Efficient Implementation for Deterministic Finite Tree Automata Minimization

Journal of Computing and Information Technology

Hadda Cherroun¹  Younes Guellouma¹ 

[1] Laboratoire LIM, Université Amar Telidji de Laghouat, Laghouat, Algérie;

关键词: automata theory;    minimization;    trees;    asymptotic complexity;   

DOI  :  10.20532/cit.2016.1002867

来源: DOAJ

【 摘 要 】

We address the problem of deterministic finite tree automata (DFTA) minimization. We describe a new alternative to implement both standard and incremental tree automata minimization using a well-defined graph representing the automaton to be minimized. We show that the asymptotic complexity of the standard implementation is linearithmic and the incremental one is O(n3 log(n)) where n is the DFTA size.

【 授权许可】

Unknown