On Rational Trees - Archive ouverte HAL Access content directly
Conference Papers Year : 2006

On Rational Trees


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.
Fichier principal
Vignette du fichier
hal.pdf (194.29 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00620171 , version 1 (03-10-2011)


  • HAL Id : hal-00620171 , version 1


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⟩
163 View
58 Download


Gmail Facebook Twitter LinkedIn More