On Rational Trees

Arnaud Carayol (1) , Christophe Morvan (2)

1 GALION - Graphs, Automata, Logics, Languages and vErificatiON
2 VERTECS - Verification models and techniques applied to testing and control of reactive systems

Rational graphs are a family of graphs defined using labelled rational transducers. Unlike automatic graphs (defined using synchronized transducers) the first order theory of these graphs is undecidable, there is even a rational graph with an undecidable first order theory. In this paper we consider the family of rational trees, that is rational graphs which are trees. We prove that first order theory is decidable for this family. We also present counter examples showing that this result cannot be significantly extended both in terms of logic and of structure.

Domaines: Algorithme et structure de données [cs.DS]

Arnaud Carayol, Christophe Morvan. On Rational Trees. 20th International Conference on Computer Science Logic (CSL'06), Sep 2006, Szeged, Hungary. pp.225-239. ⟨hal-00620171⟩