Hopcroft's automaton minimization algorithm and Sturmian words (Q2959876)
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 6683501
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hopcroft's automaton minimization algorithm and Sturmian words |
scientific article; zbMATH DE number 6683501 |
Statements
10 February 2017
0 references
finite automata
0 references
minimization algorithm
0 references
complexity
0 references
Sturmian words
0 references
0.9477102756500244
0 references
0.8956491947174072
0 references
0.8625185489654541
0 references
0.8622176051139832
0 references
0.8608944416046143
0 references
