Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata (Q5946055)
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 1658195
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata |
scientific article; zbMATH DE number 1658195 |
Statements
Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata (English)
0 references
2 July 2002
0 references
nondeterministic \(\varepsilon\)-free finite automaton
0 references
regular expressions
0 references
0 references
0.9759213328361512
0 references
0.9317674040794371
0 references
0.9213156700134276
0 references
