Tree Automata Constructions from Regular Expressions: a Comparative Study

There exist several methods of computing an automaton recognizing the language denoted by a given regular expression: In the case of words, the position automaton due to Glushkov, the c-continuation automaton due to Champarnaud and Ziadi, the follow automaton ℱ due to Ilie and Yu and the equation au...

Full description

Saved in:
Bibliographic Details
Published inFundamenta informaticae Vol. 156; no. 1; pp. 69 - 94
Main Authors Mignot, Ludovic, Sebti, Nadia Ouali, Ziadi, Djelloul
Format Journal Article
LanguageEnglish
Published London, England SAGE Publications 01.01.2017
IOS Press BV
Subjects
tree automata constructions
c-continuations
derivatives
regular tree expression
automata theory
partial derivatives
Online AccessGet full text

Cover

More Information
Summary:There exist several methods of computing an automaton recognizing the language denoted by a given regular expression: In the case of words, the position automaton due to Glushkov, the c-continuation automaton due to Champarnaud and Ziadi, the follow automaton ℱ due to Ilie and Yu and the equation automaton ɛ due to Antimirov. It has been shown that and are isomorphic and that ɛ (resp. ℱ) is a quotient of (resp. of ). In this paper, we define from a given regular tree expression the position tree automaton and the follow tree automaton ℱ. Using the definition of the equation tree automaton ɛ of Kuske and Meinecke and our previously defined c-continuation tree automaton , we show that the previous morphic relations are still valid on tree expressions.
ISSN:0169-2968
1875-8681
DOI:10.3233/FI-2017-1598