Translation of binary regular expressions into nondeterministic \(\varepsilon\)-free automata with \(O(n\log n)\) transitions (Q1401956)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Translation of binary regular expressions into nondeterministic \(\varepsilon\)-free automata with \(O(n\log n)\) transitions |
scientific article; zbMATH DE number 1967142
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Translation of binary regular expressions into nondeterministic \(\varepsilon\)-free automata with \(O(n\log n)\) transitions |
scientific article; zbMATH DE number 1967142 |
Statements
Translation of binary regular expressions into nondeterministic \(\varepsilon\)-free automata with \(O(n\log n)\) transitions (English)
0 references
19 August 2003
0 references
Formal languages
0 references
Descriptional complexity
0 references
Regular languages
0 references
Finite-state automata
0 references
Regular expressions
0 references
0 references
