Circular Sturmian words and Hopcroft's algorithm
From MaRDI portal
Publication:732029
DOI10.1016/J.TCS.2009.07.018zbMATH Open1187.68360OpenAlexW2157313018MaRDI QIDQ732029FDOQ732029
Authors: Antonio Restivo, G. Castiglione, M. Sciortino 
Publication date: 9 October 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.07.018
Recommendations
Sturmian morphismsdeterministic finite state automatacircular Sturmian wordsHopcroft's minimization algorithm
Cites Work
- The On-Line Encyclopedia of Integer Sequences
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Characterisations of balanced words via orderings
- Title not available (Why is that?)
- On an involution of Christoffel words and Sturmian morphisms
- Re-describing an algorithm by Hopcroft
- On Christoffel classes
- Implementation and Application of Automata
- Describing an algorithm by Hopcroft
- Minimisation of acyclic deterministic automata in linear time
- Hopcroft’s Algorithm and Cyclic Automata
- Hopcroft's automaton minimization algorithm and Sturmian words
- Repetitions in Sturmian strings
Cited In (16)
- Novel results on the number of runs of the Burrows-Wheeler-transform
- Tight lower and upper bounds for the complexity of canonical colour refinement
- A graph theoretic approach to automata minimality
- Minimisation of automata
- Distinct squares in circular words
- Hopcroft’s Algorithm and Cyclic Automata
- New string attractor-based complexities for infinite words
- On extremal cases of Hopcroft's algorithm
- Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm
- A challenging family of automata for classical minimization algorithms
- Nondeterministic Moore automata and Brzozowski's algorithm
- Standard Sturmian words and automata minimization algorithms
- Characteristic Sturmian words are extremal for the critical factorization theorem
- On Extremal Cases of Hopcroft’s Algorithm
- A combinatorial view on string attractors
- String attractors and infinite words
Uses Software
This page was built for publication: Circular Sturmian words and Hopcroft's algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q732029)
