From regular expressions to DFA's using compressed NFA's
From MaRDI portal
Publication:1391526
DOI10.1016/S0304-3975(96)00140-5zbMath0912.68105OpenAlexW1966773178MaRDI QIDQ1391526
Publication date: 22 July 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(96)00140-5
Related Items
Derivatives of Regular Expressions and an Application ⋮ Two Algorithms For Languages Recognized By Graph Algebras ⋮ Manipulation of regular expressions using derivatives: an overview ⋮ Efficient testing and matching of deterministic regular expressions ⋮ From regular expressions to DFA's using compressed NFA's ⋮ On algebraic array theories ⋮ Smaller representation of compiled regular expressions ⋮ Revisiting multiple pattern matching algorithms for multi-core architecture ⋮ Follow automata. ⋮ Reducing NFAs by invariant equivalences. ⋮ Partial derivatives of regular expressions and finite automaton constructions ⋮ Derivatives and Finite Automata of Expressions in Star Normal Form ⋮ One-unambiguous regular languages ⋮ One-unambiguous regular languages ⋮ Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata ⋮ From regular expressions to smaller NFAs ⋮ Fast equation automaton computation ⋮ An NSF proposal
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- From regular expressions to deterministic automata
- Using multiset discrimination to solve language processing problems without hashing
- Regular expressions into finite automata
- From regular expressions to DFA's using compressed NFA's
- Automata Studies. (AM-34)
- Linear Automaton Transformations
- Programming Techniques: Regular expression search algorithm
- Derivatives of Regular Expressions
- On the translation of languages from left to right
This page was built for publication: From regular expressions to DFA's using compressed NFA's
