Efficient Implementation for Deterministic Finite Tree Automata Minimization

Efficient Implementation for Deterministic Finite Tree Automata Minimization

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 s...

Full description

Bibliographic Details
Main Authors: Younes Guellouma, Hadda Cherroun
Format: Article
Language:English
Published: University of Zagreb Faculty of Electrical Engineering and Computing 2016-12-01
Series:Journal of Computing and Information Technology
Subjects:
automata theory
minimization
trees
asymptotic complexity
Online Access:http://cit.fer.hr/index.php/CIT/article/view/2867/2107

Internet

http://cit.fer.hr/index.php/CIT/article/view/2867/2107

Similar Items