From regular expressions to finite automata∗
From MaRDI portal
Publication:4944659
Recommendations
Cites work
- Ambiguity in Graphs and Expressions
- AUTOMATE, a computing package for automata and finite semigroups
- Derivatives of Regular Expressions
- 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
- scientific article; zbMATH DE number 3165536 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 194974 (Why is no real title available?)
- scientific article; zbMATH DE number 798342 (Why is no real title available?)
- Local languages and the Berry-Sethi algorithm
- Partial derivatives of regular expressions and finite automaton constructions
- Programming Techniques: Regular expression search algorithm
- Regular expressions into finite automata
- THE ABSTRACT THEORY OF AUTOMATA
- The complexity of restricted regular expressions and the synthesis problem for finite automata
Cited in
(25)- An optimal parallel algorithm to convert a regular expression into its Glushkov automaton
- Regular expressions into finite automata
- Characterization of Glushkov automata
- Manipulation of regular expressions using derivatives: an overview
- scientific article; zbMATH DE number 5903158 (Why is no real title available?)
- From sequential extended regular expressions to NFA with symbolic labels
- Construction of Tree Automata from Regular Expressions
- From Regular Weighted Expressions to Finite Automata
- Hopcroft’s Minimization Technique: Queues or Stacks?
- Series-Parallel Automata and Short Regular Expressions
- scientific article; zbMATH DE number 1472276 (Why is no real title available?)
- scientific article; zbMATH DE number 1773075 (Why is no real title available?)
- scientific article; zbMATH DE number 1870546 (Why is no real title available?)
- Glushkov Construction For Series: The Non Commutative Case
- Extended to multi-tilde-bar regular expressions and efficient finite automata constructions
- scientific article; zbMATH DE number 7075888 (Why is no real title available?)
- NORMALIZED EXPRESSIONS AND FINITE AUTOMATA
- VIRTUAL OPERATIONS ON VIRTUAL NETWORKS: THE PRIORITY UNION
- A Unified Construction of the Glushkov, Follow, and Antimirov Automata
- From regular expressions to deterministic automata
- The net automaton of a rational expression
- Generating tokenizers with flat automata
- Multi-tilde-bar expressions and their automata
- From regular expressions to smaller NFAs
- Obtaining shorter regular expressions from finite-state automata
This page was built for publication: From regular expressions to finite automata∗
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4944659)
