Optimised determinisation and completion of finite tree automata

John P. Gallagher, Mai Lise Ajspur, Bishoksan Kafle

Research output: Journal Article or Conference Article in JournalJournal articleResearchpeer-review


Determinisation and completion of finite tree automata are important operations with applications in program analysis and verification. However, the complexity of the classical procedures for determinisation and completion is high. They are not practical procedures for manipulating tree automata beyond very small ones. In this paper we develop an algorithm for determinisation and completion of finite tree automata, whose worst-case complexity remains unchanged, but which performs far better than existing algorithms in practice. The critical aspect of the algorithm is that the transitions of the determinised (and possibly completed) automaton are generated in a potentially very compact form called product form, which can reduce the size of the representation dramatically. Furthermore, the representation can often be used directly when manipulating the determinised automaton. The paper contains an experimental evaluation of the algorithm on a large set of tree automata examples.
Original languageEnglish
JournalJournal of Logical and Algebraic Methods in Programming
Pages (from-to)1-16
Publication statusPublished - Jan 2018


Dive into the research topics of 'Optimised determinisation and completion of finite tree automata'. Together they form a unique fingerprint.

Cite this