Comparing the size of NFAs with and without \(\epsilon\)-transitions (Q2373739): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:14, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Comparing the size of NFAs with and without \(\epsilon\)-transitions |
scientific article |
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
