Wyniki wyszukiwania - BazTech

Ograniczanie wyników

1 Fundamenta Informaticae

1 2017

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: tree automata constructions

Sortuj według:

Ogranicz wyniki do:

Tree Automata Constructions from Regular Expressions : a Comparative Study

Mignot L., Sebti N. O., Ziadi D.

Fundamenta Informaticae

2017

Vol. 156, nr 1

69--94

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 E due to Antimirov. It has been shown that P and C are isomorphic and that E (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 E 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.