Monadic second-order definable graph transductions: a survey
- 1 April 1994
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 126 (1) , 53-75
- https://doi.org/10.1016/0304-3975(94)90268-2
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Monadic second-order evaluations on tree-decomposable graphsTheoretical Computer Science, 1993
- The monadic second-order logic of graphs VII: graphs as relational structuresTheoretical Computer Science, 1992
- The monadic second-order logic of graphs V: on closing the gap between definability and recognizabilityTheoretical Computer Science, 1991
- Easy problems for tree-decomposable graphsJournal of Algorithms, 1991
- A comparison of boundary graph grammars and context-free hypergraph grammarsInformation and Computation, 1990
- 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
- Boundary NLC graph grammars—Basic definitions, normal forms, and complexityInformation and Control, 1986
- Decision problems of finite automata design and related arithmeticsTransactions of the American Mathematical Society, 1961
- Weak Second‐Order Arithmetic and Finite AutomataMathematical Logic Quarterly, 1960