HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Reports

On Rational Graphs

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 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.
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00072706
Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 10:40:10 AM
Last modification on : Friday, February 4, 2022 - 3:16:12 AM
Long-term archiving on: : Sunday, April 4, 2010 - 9:21:38 PM

Identifiers

  • HAL Id : inria-00072706, version 1

Collections

Citation

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

Share

Metrics

Record views

35

Files downloads

77