Bisimulation minimization of tree automata

Authors:
Parosh Aziz Abdulla;Lisa Kaati;Johanna Högberg
Affiliations:
Dept. of Information Technology, Uppsala University, Sweden;Dept. of Information Technology, Uppsala University, Sweden;Dept. of Computing Science, Umeå University, Sweden
Venue:
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Year:
2006

Citing 5
Cited 7

Three partition refinement algorithms

SIAM Journal on Computing
Minimal Ascending and Descending Tree Automata

SIAM Journal on Computing
Algorithms for Guided Tree Automata

WIA '96 Revised Papers from the First International Workshop on Implementing Automata
Regular Tree Model Checking

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
The equivalence problem for regular expressions with squaring requires exponential space

SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)

Tree Process Calculus

Electronic Notes in Theoretical Computer Science (ENTCS)
Composed Bisimulation for Tree Automata

CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata

Electronic Notes in Theoretical Computer Science (ENTCS)
Backward and forward bisimulation minimization of tree automata

Theoretical Computer Science
Bisimulation minimisation for weighted tree automata

DLT'07 Proceedings of the 11th international conference on Developments in language theory
Computing simulations over tree automata: efficient techniques for reducing tree automata

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Tree data decision diagrams

VECoS'08 Proceedings of the Second international conference on Verification and Evaluation of Computer and Communication Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We extend an algorithm by Paige and Tarjan that solves the coarsest stable refinement problem to the domain of trees. The algorithm is used to minimize non-deterministic tree automata (NTA) with respect to bisimulation. We show that our algorithm has an overall complexity of $O(\hat{r}m \log n)$, where $\hat{r}$ is the maximum rank of the input alphabet, m is the total size of the transition table, and n is the number of states.