A uniform (bi-)simulation-based framework for reducing tree automata

DOI10.1016/J.ENTCS.2009.08.026MaRDI QIDQ5170274zbMATH OpenOpenAlexFDO

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

Publication date 23 July 2014

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.entcs.2009.08.026

zbMATH Keywords

bisimulationcombined relationssimulationsize reductiontree automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Computing Simulations over Tree Automata
• Composed Bisimulation for Tree Automata
• Reduction of nondeterministic tree automata
• COMPOSED BISIMULATION FOR TREE AUTOMATA
• Backward and Forward Bisimulation Minimisation of Tree Automata

Cites work

• Abstract regular tree model checking
• An efficient simulation algorithm based on abstract interpretation
• Backward and Forward Bisimulation Minimisation of Tree Automata
• Bisimulation Minimisation for Weighted Tree Automata
• Bisimulation Minimization of Tree Automata
• Bisimulation relations for weighted automata
• Composed Bisimulation for Tree Automata
• Computing Simulations over Tree Automata
• scientific article; zbMATH DE number 1903379 (Why is no real title available?)
• scientific article; zbMATH DE number 1903380 (Why is no real title available?)
• Three Partition Refinement Algorithms

Cited in

(10)

• Aggregation-based minimization of finite state automata
• Reduction of nondeterministic tree automata
• Compression of finite-state automata through failure transitions
• COMPOSED BISIMULATION FOR TREE AUTOMATA
• Composed Bisimulation for Tree Automata
• TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
• Computing Simulations over Tree Automata
• Minimization of finite state automata through partition aggregation
• Simulation relations and applications in formal methods
• Mediating for reduction (on minimizing alternating Büchi automata)

This page was built for publication: A uniform (bi-)simulation-based framework for reducing tree automata

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