Random Generation of Deterministic Tree (Walking) Automata
From MaRDI portal
Publication:3637348
DOI10.1007/978-3-642-02979-0_15zbMath1248.68298MaRDI QIDQ3637348
Sylvain Schmitz, Pierre-Cyrille Héam, Cyril Nicaud
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_15
68Q45: Formal languages and automata
Related Items
Loops and Overloops for Tree Walking Automata, Generating, sampling and counting subclasses of regular tree languages, Loops and overloops for tree-walking automata
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Enumeration and random generation of accessible automata
- Random generation of DFAs
- REGAL: A Library to Randomly and Exhaustively Generate Automata
- Transitive closure logic, nested tree walking automata, and XPath
- Five Determinisation Algorithms
- Learning Minimal Separating DFA’s for Compositional Verification
- Tree-Walking Automata Do Not Recognize All Regular Languages
- Experimental Evaluation of Classical Automata Constructions
- Antichains: A New Algorithm for Checking Universality of Finite Automata