On Families of Graphs Having a Decidable First Order Theory with Reachability
Author:
- 25 June 2002
- book chapter
- Published by Springer Nature
- p. 98-109
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- The theory of ground rewrite systems is decidable2002
- Higher-Order Pushdown Trees Are Easy2002
- On Rational Graphs2000
- When can an equational simple graph be generated by hyperedge replacement?Lecture Notes in Computer Science, 1998
- Languages, Automata, and Logic1997
- On infinite transition graphs having a decidable monadic theory1996
- The monadic second-order logic of graphs IX: Machines and their behavioursTheoretical Computer Science, 1995
- The structure of the models of decidable monadic theories of graphsAnnals of Pure and Applied Logic, 1991
- The theory of ends, pushdown automata, and second-order logicTheoretical Computer Science, 1985
- Decidability of Second-Order Theories and Automata on Infinite TreesTransactions of the American Mathematical Society, 1969