The monadic second-order logic of graphs, II: Infinite graphs of bounded width
- 1 December 1988
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 21 (1), 187-221
- https://doi.org/10.1007/bf02088013
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- The structure of the models of decidable monadic theories of graphsAnnals of Pure and Applied Logic, 1991
- On systems of equations defining infinite graphsLecture Notes in Computer Science, 1989
- 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
- The theory of ends, pushdown automata, and second-order logicTheoretical Computer Science, 1985
- Toward logic tailored for computational complexityLecture Notes in Mathematics, 1984
- Fundamental properties of infinite treesTheoretical Computer Science, 1983
- Initial Algebra Semantics and Continuous AlgebrasJournal of the ACM, 1977
- Automata on Infinite Objects and Church’s ProblemCBMS Regional Conference Series in Mathematics, 1972
- Tree acceptors and some of their applicationsJournal of Computer and System Sciences, 1970