From Tree Automata to String Automata Minimization

In this paper, we propose a reduction of the minimization problem for a bottom-up deterministic tree automaton (DFTA), making the latter a minimization of a string deterministic finite automaton (DFA). To achieve this purpose, we proceed first by the transformation of the tree automaton into a parti...

Full description

Saved in:
Bibliographic Details
Published inTheory of computing systems Vol. 62; no. 5; pp. 1203 - 1222
Main Authors Guellouma, Younes, Cherroun, Hadda, Ziadi, Djelloul, Watson, Bruce W.
Format Journal Article
LanguageEnglish
Published New York Springer US 01.07.2018
Springer Nature B.V
Subjects
Automata theory
Computer Science
Construction standards
Optimization
Theory of Computation
Transformations
Minimization
Tree automata
Tree languages
Finite automata
Online AccessGet full text

Cover

More Information
Summary:In this paper, we propose a reduction of the minimization problem for a bottom-up deterministic tree automaton (DFTA), making the latter a minimization of a string deterministic finite automaton (DFA). To achieve this purpose, we proceed first by the transformation of the tree automaton into a particular string automaton, followed by minimizing this string automaton. In addition, we show that for our transformation, the minimization of the resulting string automaton coincides with the minimization of the original tree automaton. Finally, we discuss the complexity of our proposal for different types of tree automata, namely: standard, acyclic, incremental, and incrementally constructed tree automata.
ISSN:1432-4350
1433-0490
DOI:10.1007/s00224-017-9815-4