Circular Sturmian words and Hopcroft's algorithm (Q732029)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5612525
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Circular Sturmian words and Hopcroft's algorithm |
scientific article; zbMATH DE number 5612525 |
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
0.8542876243591309
0 references
0.8374696969985962
0 references
0.8298637270927429
0 references
0.8244770169258118
0 references
0.8045697808265686
0 references
