State complexity of operations on two-way finite automata over a unary alphabet (Q443746)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: State complexity of operations on two-way finite automata over a unary alphabet |
scientific article; zbMATH DE number 6065034
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | State complexity of operations on two-way finite automata over a unary alphabet |
scientific article; zbMATH DE number 6065034 |
Statements
State complexity of operations on two-way finite automata over a unary alphabet (English)
0 references
13 August 2012
0 references
finite automata
0 references
two-way automata
0 references
regular languages
0 references
unary languages
0 references
state complexity
0 references
Landau's function
0 references
0 references
0 references
0 references
0.9882490038871764
0 references
0.9366737604141236
0 references
0.9250787496566772
0 references
0.8995887637138367
0 references
0.8579506874084473
0 references
