Pages that link to "Item:Q1063420"
From MaRDI portal
The following pages link to A linear time solution to the single function coarsest partition problem (Q1063420):
Displaying 29 items.
- Standard Sturmian words and automata minimization algorithms (Q496057) (← links)
- Using multiset discrimination to solve language processing problems without hashing (Q673099) (← links)
- A theory of ultimately periodic languages and automata with an application to time granularity (Q731330) (← links)
- Transformational derivation of an improved alias analysis algorithm (Q815001) (← links)
- An NSF proposal (Q815007) (← links)
- Mechanical translation of set theoretic problem specifications into efficient RAM code - a case study (Q1100879) (← links)
- Optimal canonization of all substrings of a string (Q1183603) (← links)
- The parallel complexity of coarsest set partition problems (Q1198030) (← links)
- A derived algorithm for evaluating \(\varepsilon\)-expressions over abstract sets (Q1322849) (← links)
- An efficient parallel algorithm for the single function coarsest partition problem (Q1329732) (← links)
- Generalizations of suffix arrays to multi-dimensional matrices. (Q1401328) (← links)
- Sorting and doubling techniques for set partitioning and automata minimization problems (Q1575899) (← links)
- Re-describing an algorithm by Hopcroft (Q1589443) (← links)
- Taming the complexity of biochemical models through bisimulation and collapsing: theory and practice (Q1884863) (← links)
- An efficient algorithm for computing bisimulation equivalence (Q1884935) (← links)
- On extremal cases of Hopcroft's algorithm (Q1959649) (← links)
- Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm (Q2271419) (← links)
- Tight lower and upper bounds for the complexity of canonical colour refinement (Q2398207) (← links)
- An efficient fully symbolic bisimulation algorithm for non-deterministic systems (Q2842000) (← links)
- Hopcroft's algorithm and tree-like automata (Q3006159) (← links)
- Computing the Maximum Bisimulation with Spiking Neural P Systems (Q3009343) (← links)
- An efficient algorithm for a special case of the set partition problem (Q3477962) (← links)
- Hopcroft’s Minimization Technique: Queues or Stacks? (Q3602803) (← links)
- On Extremal Cases of Hopcroft’s Algorithm (Q3637337) (← links)
- Fast parallel Lyndon factorization with applications (Q4327381) (← links)
- Rank-Based Symbolic Bisimulation (Q4916208) (← links)
- An Incremental Bisimulation Algorithm (Q5458835) (← links)
- Generalizations of suffix arrays to multi-dimensional matrices. (Q5967094) (← links)
- Lowerbounds for Bisimulation by Partition Refinement (Q6135758) (← links)
