Monadic second-order definable graph transductions
- 1 January 1992
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 124-144
- https://doi.org/10.1007/3-540-55251-0_7
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issuesRAIRO - Theoretical Informatics and Applications, 1992
- Easy problems for tree-decomposable graphsJournal of Algorithms, 1991
- 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
- 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
- Transductions and Context-Free LanguagesPublished by Springer Nature ,1979
- Weak Second‐Order Arithmetic and Finite AutomataMathematical Logic Quarterly, 1960