The monadic second-order logic of graphs V: on closing the gap between definability and recognizability
- 31 December 1991
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 80 (2) , 153-202
- https://doi.org/10.1016/0304-3975(91)90387-h
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- The monadic second-order logic of graphs IV: definability properties of equational graphsAnnals of Pure and Applied Logic, 1990
- The monadic second-order logic of graphs. I. Recognizable sets of finite graphsInformation and Computation, 1990
- 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 algorithm to decide whether a rational subset of
N k is recognizableTheoretical Computer Science, 1985 - The Recognition of Series Parallel DigraphsSIAM Journal on Computing, 1982
- Initial Algebra Semantics and Continuous AlgebrasJournal of the ACM, 1977
- Tree acceptors and some of their applicationsJournal of Computer and System Sciences, 1970
- Algebraic automata and context-free setsInformation and Control, 1967
- Weak Second‐Order Arithmetic and Finite AutomataMathematical Logic Quarterly, 1960