Composed Bisimulation for Tree Automata

DOI10.1007/978-3-540-70844-5_22MaRDI QIDQ3602816zbMATH OpenOpenAlexFDO

Authors Ahmed Bouajjani, Lukáš Holik, Lisa Kaati, Tomáš Vojnar, Parosh A. Abdulla

Publication date 12 February 2009

Published in Implementation and Applications of Automata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70844-5_22

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• COMPOSED BISIMULATION FOR TREE AUTOMATA
• A uniform (bi-)simulation-based framework for reducing tree automata
• Computing Simulations over Tree Automata
• Backward and forward bisimulation minimization of tree automata
• BISIMULATION MINIMIZATION OF TREE AUTOMATA

Cited in

(7)

• Reduction of nondeterministic tree automata
• COMPOSED BISIMULATION FOR TREE AUTOMATA
• Backward and Forward Bisimulation Minimisation of Tree Automata
• A uniform (bi-)simulation-based framework for reducing tree automata
• Computing Simulations over Tree Automata
• Bisimulation Minimization of Tree Automata
• Backward and forward bisimulation minimization of tree automata

This page was built for publication: Composed Bisimulation for Tree Automata

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