Circular Sturmian words and Hopcroft's algorithm (Q732029): Difference between revisions
From MaRDI portal
Latest revision as of 00:14, 2 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Circular Sturmian words and Hopcroft's algorithm |
scientific article |
Statements
Circular Sturmian words and Hopcroft's algorithm (English)
0 references
9 October 2009
0 references
deterministic finite state automata
0 references
Hopcroft's minimization algorithm
0 references
circular Sturmian words
0 references
Sturmian morphisms
0 references