A New Family of Regular Operators Fitting with the Position Automaton Computation

DOI10.1007/978-3-540-95891-8_57zbMath1206.68169OpenAlexW1570256538MaRDI QIDQ3599111

Ludovic Mignot, Pascal Caron, Jean-Marc Champarnaud

Publication date: 3 February 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-95891-8_57

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Constrained multi-tildes ⋮ Acyclic automata and small expressions using multi-tilde-bar operators ⋮ Multi-tilde-bar expressions and their automata ⋮ Multi-tilde Operators and Their Glushkov Automata ⋮ Small Extended Expressions for Acyclic Automata

Uses Software

• LANGAGE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Regular expression for a language without empty word
• Follow automata.
• Characterization of Glushkov automata
• Computingϵ-Free NFA from Regular Expressions inO(nlog²(n)) Time
• FROM C-CONTINUATIONS TO NEW QUADRATIC ALGORITHMS FOR AUTOMATON SYNTHESIS
• Mathematical Foundations of Computer Science 2004
• Implementation and Application of Automata
• Implementation and Application of Automata
• Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata

This page was built for publication: A New Family of Regular Operators Fitting with the Position Automaton Computation