From regular expressions to finite automata∗

DOI10.1080/00207169908804865zbMath0949.68090WikidataQ126246104 ScholiaQ126246104MaRDI QIDQ4944659

Jean-Marc Champarnaud, Djelloul Ziadi, Jean-Luc Ponty

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

zbMATH Keywords

Glushkov automaton; Brzozowski algorithm

Mathematics Subject Classification ID

68Q45: Formal languages and automata

Related Items

Glushkov Construction For Series: The Non Commutative Case, VIRTUAL OPERATIONS ON VIRTUAL NETWORKS: THE PRIORITY UNION, An optimal parallel algorithm to convert a regular expression into its Glushkov automaton, From Sequential Extended Regular Expressions to NFA with Symbolic Labels, Hopcroft’s Minimization Technique: Queues or Stacks?

Uses Software

• AMoRE

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item