Small Extended Expressions for Acyclic Automata
From MaRDI portal
Publication:3637357
DOI10.1007/978-3-642-02979-0_23zbMath1248.68288OpenAlexW156518268MaRDI QIDQ3637357
Pascal Caron, Ludovic Mignot, Jean-Marc Champarnaud
Publication date: 9 July 2009
Published in: Implementation and Application of Automata (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02979-0_23
Related Items (2)
Sampling different kinds of acyclic automata using Markov chains ⋮ Random Generation of Deterministic Acyclic Automata Using Markov Chains
Uses Software
Cites Work
- 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: Small Extended Expressions for Acyclic Automata