A lower bound on the size of \(\varepsilon\)-free NFA corresponding to a regular expression (Q1007546)
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 5530891
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A lower bound on the size of \(\varepsilon\)-free NFA corresponding to a regular expression |
scientific article; zbMATH DE number 5530891 |
Statements
A lower bound on the size of \(\varepsilon\)-free NFA corresponding to a regular expression (English)
0 references
23 March 2009
0 references
formal languages
0 references
regular expressions
0 references
combinatorial problems
0 references
epsilon-free nondeterministic automata
0 references
0.9120911955833436
0 references
0.8840309381484985
0 references
0.8806103467941284
0 references
