Construction of rational expression from tree automata using a generalization of Arden's Lemma
Formal Languages and Automata Theory
2015-02-02 v1
Abstract
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 paper we generalize this important lemma to the rational tree languages. Moreover, we propose also a construction of a rational tree expression which denotes the accepted tree language of a finite tree automaton.
Keywords
Cite
@article{arxiv.1501.07686,
title = {Construction of rational expression from tree automata using a generalization of Arden's Lemma},
author = {Younes Guellouma and Ludovic Mignot and Hadda Cherroun and Djelloul Ziadi},
journal= {arXiv preprint arXiv:1501.07686},
year = {2015}
}