Unambiguous finite automata over a unary alphabet (Q418147): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q57380783, #quickstatements; #temporary_batch_1707161894653 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57380783 / rank | |||
Normal rank | |||
Revision as of 21:54, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Unambiguous finite automata over a unary alphabet |
scientific article |
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
