A Taxonomy of Minimisation Algorithms for Deterministic Tree Automata
2016 (English)In: Journal of universal computer science (Online), ISSN 0948-695X, E-ISSN 0948-6968, Vol. 22, no 2, 180-196 p.Article in journal (Refereed) PublishedText
We present a taxonomy of algorithms for minimising deterministic bottom-up tree automata (DTAs) over ranked and ordered trees. Automata of this type and its extensions are used in many application areas, including natural language processing (NLP) and code generation. In practice, DTAs can grow very large, but minimisation keeps things manageable. The proposed taxonomy serves as a unifying framework that makes algorithms accessible and comparable, and as a foundation for efficient implementation. Taxonomies of this type are also convenient for correctness and complexity analysis, as results can frequently be propagated through the hierarchy. The taxonomy described herein covers a broad spectrum of algorithms, ranging from novel to well-studied ones, with a focus on computational complexity.
Place, publisher, year, edition, pages
2016. Vol. 22, no 2, 180-196 p.
deterministic bottom-up tree automata, automata minimisation, algorithm taxonomies
Computer and Information Science
IdentifiersURN: urn:nbn:se:umu:diva-122590ISI: 000376442200002OAI: oai:DiVA.org:umu-122590DiVA: diva2:939683