Comparing the size of NFAs with and without \(\epsilon\)-transitions (Q2373739)
From MaRDI portal
!
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 5171356
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Comparing the size of NFAs with and without \(\epsilon\)-transitions |
scientific article; zbMATH DE number 5171356 |
Statements
Comparing the size of NFAs with and without \(\epsilon\)-transitions (English)
0 references
16 July 2007
0 references
finite automata
0 references
descriptional complexity
0 references
lower bounds on complexity
0 references
0 references
0 references
0.942707359790802
0 references
0.8615220785140991
0 references
0.8366665840148926
0 references
0.803825855255127
0 references
