A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata

DOI10.1016/j.entcs.2009.08.026zbMath1291.68223OpenAlexW2114998520MaRDI QIDQ5170274

Tomáš Vojnar, Lisa Kaati, Lukáš Holík, Parosh Aziz 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

simulationbisimulationtree automatasize reductioncombined relations

Mathematics Subject Classification ID

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

Related Items

Compression of finite-state automata through failure transitions, Simulation relations and applications in formal methods, Minimization of Finite State Automata Through Partition Aggregation, Aggregation-based minimization of finite state automata, Mediating for reduction (on minimizing alternating Büchi automata), TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An efficient simulation algorithm based on abstract interpretation
• Bisimulation relations for weighted automata
• Backward and Forward Bisimulation Minimisation of Tree Automata
• Composed Bisimulation for Tree Automata
• Three Partition Refinement Algorithms
• Bisimulation Minimisation for Weighted Tree Automata
• Computing Simulations over Tree Automata
• Bisimulation Minimization of Tree Automata