Publication Details
A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata
Holík Lukáš, doc. Mgr., Ph.D. (DITS FIT BUT)
Kaati Lisa (Uppsala)
Vojnar Tomáš, prof. Ing., Ph.D. (DITS FIT BUT)
tree automata, bisimulation, simulation, combined relations, size reduction
In this paper, we address the problem of reducing the size of nondeterministic (bottom-up) tree automata. We propose a uniform framework that allows for combining various upward and downward bisimulation and simulation relations in order to obtain a language-preserving combined relation suitable for reducing tree automata without a need to determinise them. The framework generalises and extends several previous works and provides a broad spectrum of different relations yielding a possibility of a fine choice between the amount of reduction and the computational demands. We, moreover, provide a significantly improved way of computing the various combined (bi-)simulation relations. We analyse properties of the considered relations both theoretically as well as through a series of experiments.
@ARTICLE{FITPUB9030, author = "A. Parosh Abdulla and Luk\'{a}\v{s} Hol\'{i}k and Lisa Kaati and Tom\'{a}\v{s} Vojnar", title = "A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata", pages = "27--48", booktitle = "Proceedings of the International Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2008)", journal = "Electronic Notes in Theoretical Computer Science", volume = 2009, number = 251, year = 2009, ISSN = "1571-0661", language = "english", url = "https://www.fit.vut.cz/research/publication/9030" }