COMPOSED BISIMULATION FOR TREE AUTOMATA

DOI10.1142/S0129054109006814MaRDI QIDQ3395139zbMATH OpenOpenAlexFDO

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

Publication date 21 August 2009

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054109006814

zbMATH Keywords

bisimulationfinite tree automatasize reduction

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

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

Cites work

• Three Partition Refinement Algorithms
• Tree regular model checking: a simulation-based approach

Cited in

(5)

• Backward and Forward Bisimulation Minimisation of Tree Automata
• Composed Bisimulation for Tree Automata
• A uniform (bi-)simulation-based framework for reducing tree automata
• Computing Simulations over Tree Automata
• From tree automata to string automata minimization

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 Q3395139)