Corpus ID: 14530426

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

@article{Guellouma2015ConstructionOR,
  title={Construction of rational expression from tree automata using a generalization of Arden's Lemma},
  author={Y. Guellouma and Ludovic Mignot and H. Cherroun and D. Ziadi},
  journal={ArXiv},
  year={2015},
  volume={abs/1501.07686}
}
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. 
Extending Timbuk to Verify Functional Programs

References

SHOWING 1-10 OF 17 REFERENCES
Construction of tree automata from regular expressions
Generalized finite automata theory with an application to a decision problem of second-order logic
Partial Derivatives of Regular Expressions and Finite Automaton Constructions
$k$-Position, Follow, Equation and $k$-C-Continuation Tree Automata Constructions
An Efficient Algorithm for the Equation Tree Automaton via the k-C-Continuations
From Regular Tree Expression to Position Tree Automaton
On Minimizing Deterministic Tree Automata
From C-Continuations to New Quadratic Algorithms for Automaton Synthesis
Tree automata techniques and applications
...
1
2
...