id: 01512622
dt: a
an: 01512622
au: Morvan, Christophe
ti: On rational graphs.
so: Tiuryn, Jerzy (ed.), Foundations of software science and computation
    structures. 3rd international conference, FOSSACS 2000. Held as part of
    the joint European conferences on theory and practice of software,
    ETAPS 2000, Berlin, Germany, March 25 - April 2, 2000. Proceedings.
    Berlin: Springer. Lect. Notes Comput. Sci. 1784, 252-266 (2000).
py: 2000
pu: Berlin: Springer
la: EN
cc: 
ut: graphs of Courcelle; graphs of Caucal
ci: 
li: 
ab: Summary: 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.
rv: