K-Position, Follow, Equation and K-C-Continuation Tree Automata Constructions - Normandie Université Access content directly
Conference Papers Year : 2014

K-Position, Follow, Equation and K-C-Continuation Tree Automata Constructions

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 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 k-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 k-C-continuation tree automaton C, we show that the previous morphic relations are still valid on tree expressions.

Dates and versions

hal-02335283 , version 1 (28-10-2019)

Identifiers

Cite

Ludovic Mignot, Nadia Ouali Sebti, Djelloul Ziadi. K-Position, Follow, Equation and K-C-Continuation Tree Automata Constructions. Proceedings 14th International Conference on Automata and Formal Languages, AFL 2014, Szeged, Hungary, May 27-29, 2014., 2014, Szeged, Hungary. pp.327--341, ⟨10.4204/EPTCS.151.23⟩. ⟨hal-02335283⟩
20 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More