Graph rewriting: an algebraic and logic approach
Handbook of theoretical computer science (vol. B)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
On Infinite Transition Graphs Having a Decidable Monadic Theory
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
A Chomsky-Like Hierarchy of Infinite Graphs
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
On Families of Graphs Having a Decidable First Order Theory with Reachability
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Ground Tree Rewriting Graphs of Bounded Tree Width
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Axiomatising Tree-Interpretable Structures
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
On Word Rewriting Systems Having a Rational Derivation
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Model-Checking Infinite Systems Generated by Ground Tree Rewriting
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
A Short Introduction to Infinite Automata
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Some Applications of the Decidability of DPDA's Equivalence
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
On the Transition Graphs of Turing Machines
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Linearly bounded infinite graphs
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Algorithmic metatheorems for decidable LTL model checking over infinite systems
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Thue Specifications, Infinite Graphs and Synchronized Product
Fundamenta Informaticae
Traces of term-automatic graphs
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Automata for infinite argumentation structures
Artificial Intelligence
| Hi-index | 0.00 |
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.