Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation (Q3034835)
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: Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation |
scientific article; zbMATH DE number 4133510
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation |
scientific article; zbMATH DE number 4133510 |
Statements
Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation (English)
0 references
1989
0 references
succinctness of representation
0 references
nondeterministic finite automaton
0 references
ambiguity
0 references
0.9155089
0 references
0.9052514
0 references
0.9043114
0 references
0.89604354
0 references
0.88260096
0 references
0.8791081
0 references
0 references
