Unambiguous finite automata over a unary alphabet (Q418147)
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: Unambiguous finite automata over a unary alphabet |
scientific article; zbMATH DE number 6038297
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Unambiguous finite automata over a unary alphabet |
scientific article; zbMATH DE number 6038297 |
Statements
Unambiguous finite automata over a unary alphabet (English)
0 references
24 May 2012
0 references
The trade-off in the number of states is determined for the conversion of special non-deterministic finite automata (NFA) to deterministic ones (DFA) accepting the same language. The special NFA considered here are unambiguous finite automata over a single letter alphabet. The number of states needed for a DFA for such a special NFA is smaller than for an arbitrary NFA.
0 references
finite automata
0 references
unary languages
0 references
ambiguity
0 references
state complexity
0 references
trade-offs in number of states
0 references
Landau's function
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8868487477302551
0 references
0.855470597743988
0 references
0.8484412431716919
0 references
0.8238182663917542
0 references
0.8223075866699219
0 references
