From regular expressions to smaller NFAs
From MaRDI portal
Publication:719325
DOI10.1016/j.tcs.2011.05.058zbMath1222.68103DBLPjournals/tcs/GarciaLRA11OpenAlexW2022156557WikidataQ58209336 ScholiaQ58209336MaRDI QIDQ719325
Publication date: 10 October 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10251/37982
Related Items (2)
Postfix automata ⋮ From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity
Cites Work
- From regular expressions to deterministic automata
- Partial derivatives of regular expressions and finite automaton constructions
- Local languages and the Berry-Sethi algorithm
- The passing of a rational expression to a nondeterministic finite automaton
- Regular expressions into finite automata
- From regular expressions to DFA's using compressed NFA's
- Follow automata.
- Canonical derivatives, partial derivatives and finite automaton constructions.
- THE ABSTRACT THEORY OF AUTOMATA
- FROM C-CONTINUATIONS TO NEW QUADRATIC ALGORITHMS FOR AUTOMATON SYNTHESIS
- NORMALIZED EXPRESSIONS AND FINITE AUTOMATA
- Programming Techniques: Regular expression search algorithm
- Unnamed Item
This page was built for publication: From regular expressions to smaller NFAs