Abstract
Using rationality, like in language theory, we define a family of infinite graphs. This family is a strict extension of the context-free graphs of Muller and Schupp, the equational graphs of Courcelle and the prefix recognizable graphs of Caucal. We give basic properties, as well as an internal and an external characterization of these graphs. We also show that their traces form an AFL of recursive languages, containing the context-free languages.
Chapter PDF
Similar content being viewed by others
References
A. Arnold and M. Nivat, Comportements de processus, Colloque AFCET “les mathéematiques de l’informatique”, pp. 35–68, 1982.
J.-M. Autebert and L. Boasson, Transductions rationelles, Ed. Masson, pp. 1–133, 1988.
J. Berstel Transductions and context-free languages, Ed. Teubner, pp. 1–278, 1979.
D. Caucal On transition graphs having a decidable monadic theory, LNCS 1099, pp. 194–205, 1996
B. Courcelle Graph rewriting: an algebraic and logic approach, Handbook of TCS, Vol. B, Elsevier, pp. 193–242, 1990.
S. Ginsburg and S. A. Greibach Mappings which preserve context sensitive languages, Information and Control 9, pp. 563–582, 1966.
J. E. Hopcroft and J. D. Ullman Introduction to automata theory, langages and computation, Ed. Addison-Wesley pp. 1–284, 1979.
T. Knapik and E. Payet Synchronization product of Linear Bounded Machines, LNCS 1684, pp. 362–373, 1999.
D. Muller and P. Schupp The theory of ends, pushdown automata, and second-order logic, TCS 37, pp. 51–75, 1985.
M. Nivat Transduction des langages de Chomsky, Ann. de l’Inst. Fourier 18, pp. 339–456, 1968.
W. Reisig Petri nets. EATCS Monographs on Theoretical Computer Science, Vol. 4, Springer Verlag, 1985.
M.P. Schützenberger Sur les relations rationnelles entre monoïdes libres, TCS 3, pp. 243–259, 1976.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Morvan, C. (2000). On Rational Graphs. In: Tiuryn, J. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2000. Lecture Notes in Computer Science, vol 1784. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46432-8_17
Download citation
DOI: https://doi.org/10.1007/3-540-46432-8_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67257-9
Online ISBN: 978-3-540-46432-7
eBook Packages: Springer Book Archive