Comparing the size of NFAs with and without \(\epsilon\)-transitions (Q2373739): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2007.02.063 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1968090455 / rank | |||
Normal rank | |||
Revision as of 21:30, 19 March 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
