A lower bound on the size of \(\varepsilon\)-free NFA corresponding to a regular expression (Q1007546)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound on the size of \(\varepsilon\)-free NFA corresponding to a regular expression |
scientific article |
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
