Graph rewriting: an algebraic and logic approach
Handbook of theoretical computer science (vol. B)
The monadic second-order logic of graphs IX: machines and their behaviours
Selected papers of the workshop on Topology and completion in semantics
Languages, automata, and logic
Handbook of formal languages, vol. 3
When Can an Equational Simple Graph Be Generated by Hyperedge Replacement?
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
On Infinite Transition Graphs Having a Decidable Monadic Theory
ICALP '96 Proceedings of the 23rd 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
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
Higher-Order Pushdown Trees Are Easy
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
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
On equivalent representations of infinite structures
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Some perspectives of infinite-state verification
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Automata for infinite argumentation structures
Artificial Intelligence
| Hi-index | 0.00 |
We consider a new class of infinite graphs defined as the smallest solution of equational systems with vertex replacement operators and unsynchronised product. We show that those graphs have an equivalent internal representation as graphs of recognizable ground term rewritingsystems. Furthermore, we show that, when restricted to bounded tree-width, those graphs are isomorphic to hyperedge replacement equational graphs. Finally, we prove that on a wider family of graphs -- interpretations of trees having a decidable monadic theory -- the first order theory with reachability is decidable.