Construction of rational expression from tree automata using a generalization of Arden's Lemma

Younes Guellouma, Ludovic Mignot, Hadda Cherroun +1

Arden's Lemma is a classical result in language theory allowing the computation of a rational expression denoting the language recognized by a finite string automaton. In this pape…