Pages that link to "Item:Q732029"
From MaRDI portal
The following pages link to Circular Sturmian words and Hopcroft's algorithm (Q732029):
Displaying 13 items.
- A graph theoretic approach to automata minimality (Q418805) (← links)
- Standard Sturmian words and automata minimization algorithms (Q496057) (← links)
- Characteristic Sturmian words are extremal for the critical factorization theorem (Q714825) (← links)
- Novel results on the number of runs of the Burrows-Wheeler-transform (Q831816) (← links)
- On extremal cases of Hopcroft's algorithm (Q1959649) (← links)
- Minimisation of automata (Q2074212) (← links)
- A combinatorial view on string attractors (Q2216440) (← 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)
- A Challenging Family of Automata for Classical Minimization Algorithms (Q3073644) (← links)
- On Extremal Cases of Hopcroft’s Algorithm (Q3637337) (← links)
- Distinct Squares in Circular Words (Q5150916) (← links)
- Nondeterministic Moore Automata and Brzozowski’s Algorithm (Q5200055) (← links)
