Random generation of nondeterministic finite-state tree automata

MaRDI QIDQ4994130zbMATH OpenFDO

Authors Thomas Hanneforth, Andreas Maletti, Daniel Quernheim

Publication date 17 June 2021

Full work available at URL https://arxiv.org/abs/1311.5568, http://eptcs.web.cse.unsw.edu.au/paper.cgi?TTATT2013.2

Mathematics Subject Classification ID

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

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

Cited in

(4)

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

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)