The monadic second-order logic of graphs IV: definability properties of equational graphs
- 22 October 1990
- journal article
- Published by Elsevier in Annals of Pure and Applied Logic
- Vol. 49 (3) , 193-255
- https://doi.org/10.1016/0168-0072(90)90027-y
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Infinite hypergraphsTheoretical Computer Science, 1992
- The monadic second-order logic of graphs. I. Recognizable sets of finite graphsInformation and Computation, 1990
- The monadic second-order logic of graphs, II: Infinite graphs of bounded widthTheory of Computing Systems, 1988
- An axiomatic definition of context-free rewriting and its application to NLC graph grammarsTheoretical Computer Science, 1987
- Graph expressions and graph rewritingsTheory of Computing Systems, 1987
- Equivalences and transformations of regular systems—Applications to recursive program schemes and grammarsTheoretical Computer Science, 1986
- An axiomatic approach to the Korenjak-Hopcroft algorithmsTheory of Computing Systems, 1983
- Fundamental properties of infinite treesTheoretical Computer Science, 1983
- Least fixed point of a functorJournal of Computer and System Sciences, 1979
- Weak Second‐Order Arithmetic and Finite AutomataMathematical Logic Quarterly, 1960