Random Generation of Deterministic Tree (Walking) Automata
From MaRDI portal
Publication:3637348
Recommendations
- Parametric random generation of deterministic tree automata
- Random generation of nondeterministic finite-state tree automata
- Enumeration and random generation of possibly incomplete deterministic automata
- Random generation of deterministic acyclic automata using the recursive method
- Random generation of deterministic acyclic automata using Markov chains
Cites work
- scientific article; zbMATH DE number 1408335 (Why is no real title available?)
- Antichains: A New Algorithm for Checking Universality of Finite Automata
- Büchi complementation made tight
- Enumeration and random generation of accessible automata
- Enumeration and random generation of possibly incomplete deterministic automata
- Experimental Evaluation of Classical Automata Constructions
- Five Determinisation Algorithms
- Learning Minimal Separating DFA’s for Compositional Verification
- On the average complexity of Moore's state minimization algorithm
- REGAL: A Library to Randomly and Exhaustively Generate Automata
- Random generation of DFAs
- Transitive closure logic, nested tree walking automata, and XPath
- Tree-Walking Automata Do Not Recognize All Regular Languages
Cited in
(7)- Generating, sampling and counting subclasses of regular tree languages
- Loops and overloops for tree-walking automata
- Random generation of nondeterministic finite-state tree automata
- Random generation and enumeration of accessible deterministic real-time pushdown automata
- Loops and overloops for tree walking automata
- Parametric random generation of deterministic tree automata
- Random generation of DFAs
This page was built for publication: Random Generation of Deterministic Tree (Walking) Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637348)
