Random generation of nondeterministic finite-state tree automata

zbMATH Open1464.68169arXiv1311.5568MaRDI QIDQ4994130FDOQ4994130

Authors: Thomas Hanneforth, Andreas Maletti, Daniel Quernheim 

Publication date: 17 June 2021

Full work available at URL: https://arxiv.org/abs/1311.5568

Recommendations

• Random Generation of Deterministic Tree (Walking) Automata
• Parametric random generation of deterministic tree automata
• scientific article; zbMATH DE number 2201360
• On the uniform random generation of non deterministic automata up to isomorphism
• Finitely nonstationary nondeterministic automata with random input

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Cited In (4)

• Random Generation of Deterministic Tree (Walking) Automata
• Random Generation for Finitely Ambiguous Context-free Languages
• Parametric random generation of deterministic tree automata
• Random generation of DFAs

This page was built for publication: Random generation of nondeterministic finite-state tree automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4994130)