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. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Carayol, A., & Morvan, C. (2006). On rational trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4207 LNCS, pp. 225–239). Springer Verlag. https://doi.org/10.1007/11874683_15
Mendeley helps you to discover research relevant for your work.