Operational state complexity of prefix-free regular languages (Q3655366)
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 5654540
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Operational state complexity of prefix-free regular languages |
scientific article; zbMATH DE number 5654540 |
Statements
7 January 2010
0 references
state complexity
0 references
regular languages
0 references
deterministic finite-state automata
0 references
0.9361264109611512
0 references
0.9173405170440674
0 references
0.9044812917709352
0 references
0.9014670252799988
0 references
