Acyclic automata and small expressions using multi-tilde-bar operators

DOI10.1016/j.tcs.2010.05.023zbMath1207.68183OpenAlexW1981156238MaRDI QIDQ1959650

Pascal Caron, Ludovic Mignot, Jean-Marc Champarnaud

Publication date: 7 October 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.05.023

zbMATH Keywords

regular languagesfinite-state automataregular operators

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (6)

Sampling different kinds of acyclic automata using Markov chains ⋮ Extended to multi-tilde-bar regular expressions and efficient finite automata constructions ⋮ Erratum to ``Acyclic automata and small expressions using multi-tilde-bar operators [Theoret. Comput. Sci. 411 (38-39) (2010) 3423-3435] ⋮ Multi-tilde-bar expressions and their automata ⋮ Random Generation of Deterministic Acyclic Automata Using Markov Chains ⋮ Operads, quasiorders, and regular languages

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 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
• Multi-tilde Operators and Their Glushkov Automata
• FROM C-CONTINUATIONS TO NEW QUADRATIC ALGORITHMS FOR AUTOMATON SYNTHESIS
• Implementation and Application of Automata
• Boolean Matrices and the Stability of Neural Nets

This page was built for publication: Acyclic automata and small expressions using multi-tilde-bar operators