State complexity of regular languages (Q2731279)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 1625729
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | State complexity of regular languages |
scientific article; zbMATH DE number 1625729 |
Statements
31 January 2002
0 references
state complexity
0 references
complexity measure
0 references
regular languages
0 references
deterministic finite automaton model
0 references
State complexity of regular languages (English)
0 references
0.8945874571800232
0 references
0.8725923895835876
0 references
0.8666195869445801
0 references
0.8630757927894592
0 references
