On Rational Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2000

On Rational Graphs


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 recogniza- ble 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.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-3944.pdf (349.47 Ko) Télécharger le fichier

Dates and versions

inria-00072706 , version 1 (24-05-2006)


  • HAL Id : inria-00072706 , version 1


Christophe Morvan. On Rational Graphs. [Research Report] RR-3944, INRIA. 2000. ⟨inria-00072706⟩
36 View
85 Download


Gmail Facebook Twitter LinkedIn More