BISIMULATION MINIMIZATION OF TREE AUTOMATA

DOI10.1142/S0129054107004929zbMath1143.68428OpenAlexW2118707006MaRDI QIDQ3503087

Lisa Kaati, Johanna Högberg, Parosh Aziz Abdulla

Publication date: 20 May 2008

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

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

zbMATH Keywords

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

Related Items (5)

Backward and forward bisimulation minimization of tree automata ⋮ Unnamed Item ⋮ Tree Process Calculus ⋮ MINIMIZATION OF PLANAR DIRECTED ACYCLIC GRAPH ALGEBRAS ⋮ A Congruence-Based Perspective on Finite Tree Automata

Cites Work

• Tree regular model checking: a simulation-based approach
• Three Partition Refinement Algorithms
• Minimal Ascending and Descending Tree Automata
• Symbolic model checking with rich assertional languages

This page was built for publication: BISIMULATION MINIMIZATION OF TREE AUTOMATA