Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata (Q4210084)
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: Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata |
scientific article; zbMATH DE number 1200716
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata |
scientific article; zbMATH DE number 1200716 |
Statements
Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata (English)
0 references
20 September 1998
0 references
nondeterministic finite automata
0 references
ambiguity
0 references
succinctness of representation
0 references
0.8448265194892883
0 references
0.8433979749679565
0 references
0.8133314251899719
0 references
0.8028234839439392
0 references
