Multi-tilde Operators and Their Glushkov Automata

DOI10.1007/978-3-642-00982-2_25zbMath1234.68203OpenAlexW2172112898MaRDI QIDQ3618589

Pascal Caron, Ludovic Mignot, Jean-Marc Champarnaud

Publication date: 2 April 2009

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00982-2_25

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

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

Uses Software

• LANGAGE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Obtaining shorter regular expressions from finite-state automata
• Regular expressions into finite automata
• Regular expression for a language without empty word
• Follow automata.
• Characterization of Glushkov automata
• Finite Automata, Digraph Connectivity, and Regular Expression Size
• A New Family of Regular Operators Fitting with the Position Automaton Computation
• Computingϵ-Free NFA from Regular Expressions inO(nlog²(n)) Time
• FROM C-CONTINUATIONS TO NEW QUADRATIC ALGORITHMS FOR AUTOMATON SYNTHESIS
• Implementation and Application of Automata
• Boolean Matrices and the Stability of Neural Nets
• Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata

This page was built for publication: Multi-tilde Operators and Their Glushkov Automata