Back to Search
Start Over
Tree Automata Constructions from Regular Expressions: a Comparative Study.
- Source :
-
Fundamenta Informaticae . 2017, Vol. 156 Issue 1, p69-94. 26p. - Publication Year :
- 2017
-
Abstract
- 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 P due to Glushkov, the c-continuation automaton C due to Champarnaud and Ziadi, the follow automaton F due to Ilie and Yu and the equation automaton ε due to Antimirov. It has been shown that P and C are isomorphic and that ε (resp. F) is a quotient of C (resp. of P). In this paper, we define from a given regular tree expression the position tree automaton P and the follow tree automaton F. Using the definition of the equation tree automaton ε of Kuske and Meinecke and our previously defined c-continuation tree automaton C, we show that the previous morphic relations are still valid on tree expressions. [ABSTRACT FROM AUTHOR]
- Subjects :
- *ROBOTS
*EPIPHENOMENALISM
*EQUATIONS
*CONTINUOUS functions
*DECISION trees
Subjects
Details
- Language :
- English
- ISSN :
- 01692968
- Volume :
- 156
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- Fundamenta Informaticae
- Publication Type :
- Academic Journal
- Accession number :
- 126024389
- Full Text :
- https://doi.org/10.3233/FI-2017-1598