The following pages link to (Q2959876):
Displaying 8 items.
- Characteristic Sturmian words are extremal for the critical factorization theorem (Q714825) (← links)
- Circular Sturmian words and Hopcroft's algorithm (Q732029) (← links)
- Flexibility of the pressure function (Q2090440) (← links)
- Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm (Q2271419) (← links)
- Forward Bisimulations for Nondeterministic Symbolic Finite Automata (Q3303912) (← links)
- Hopcroft’s Algorithm and Cyclic Automata (Q3540107) (← links)
- Minimum complexity of automatic non sturmian sequences (Q4858845) (← links)
- Epichristoffel Words and Minimization of Moore Automata (Q5259268) (← links)