Lower bounds for the transition complexity of NFAs (Q955341)
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: Lower bounds for the transition complexity of NFAs |
scientific article; zbMATH DE number 5369041
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower bounds for the transition complexity of NFAs |
scientific article; zbMATH DE number 5369041 |
Statements
Lower bounds for the transition complexity of NFAs (English)
0 references
19 November 2008
0 references
regular languages
0 references
descriptional complexity
0 references
nondeterministic finite automata
0 references
finite projective planes
0 references
0 references
0 references
0 references
0 references
0.981457531452179
0 references
0.8156635761260986
0 references
0.8121825456619263
0 references
0.8084507584571838
0 references
0.7999599575996399
0 references
