From regular expressions to finite automata∗
From MaRDI portal
Publication:4944659
DOI10.1080/00207169908804865zbMath0949.68090OpenAlexW2134759302WikidataQ126246104 ScholiaQ126246104MaRDI QIDQ4944659
Djelloul Ziadi, Jean-Luc Ponty, Jean-Marc Champarnaud
Publication date: 21 March 2000
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207169908804865
Related Items
Glushkov Construction For Series: The Non Commutative Case ⋮ Manipulation of regular expressions using derivatives: an overview ⋮ The net automaton of a rational expression ⋮ VIRTUAL OPERATIONS ON VIRTUAL NETWORKS: THE PRIORITY UNION ⋮ Extended to multi-tilde-bar regular expressions and efficient finite automata constructions ⋮ Multi-tilde-bar expressions and their automata ⋮ Hopcroft’s Minimization Technique: Queues or Stacks? ⋮ From Sequential Extended Regular Expressions to NFA with Symbolic Labels ⋮ An optimal parallel algorithm to convert a regular expression into its Glushkov automaton
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Erratum to ``Acyclic automata and small expressions using multi-tilde-bar operators [Theoret. Comput. Sci. 411 (38-39) (2010) 3423-3435]
- From regular expressions to deterministic automata
- Partial derivatives of regular expressions and finite automaton constructions
- Local languages and the Berry-Sethi algorithm
- The complexity of restricted regular expressions and the synthesis problem for finite automata
- AUTOMATE, a computing package for automata and finite semigroups
- Regular expressions into finite automata
- THE ABSTRACT THEORY OF AUTOMATA
- Programming Techniques: Regular expression search algorithm
- Ambiguity in Graphs and Expressions
- Derivatives of Regular Expressions
This page was built for publication: From regular expressions to finite automata∗
