Random Generation of Deterministic Tree (Walking) Automata

DOI10.1007/978-3-642-02979-0_15zbMath1248.68298OpenAlexW1875023514MaRDI QIDQ3637348

Cyril Nicaud, Sylvain Schmitz, Pierre-Cyrille Héam

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Generating, sampling and counting subclasses of regular tree languages ⋮ Loops and overloops for tree-walking automata ⋮ Loops and Overloops for Tree Walking Automata

Uses Software

• REGAL
• Antichains

Cites Work

• 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
• Büchi Complementation Made Tight
• Antichains: A New Algorithm for Checking Universality of Finite Automata

This page was built for publication: Random Generation of Deterministic Tree (Walking) Automata