A characterization of context-free NCE graph languages by monadic second-order logic on trees

This publication has 23 references indexed in Scilit:

• On polynomial time graph grammars
  Published by Springer Nature ,2006
• The monadic second-order logic of graphs. I. Recognizable sets of finite graphs
  Information and Computation, 1990
• Context-free NCE graph grammars
  Lecture Notes in Computer Science, 1989
• Problems easy for tree-decomposable graphs extended abstract
  Published by Springer Nature ,1988
• An axiomatic definition of context-free rewriting and its application to NLC graph grammars
  Theoretical Computer Science, 1987
• Graph expressions and graph rewritings
  Theory of Computing Systems, 1987
• Complement reducible graphs
  Discrete Applied Mathematics, 1981
• Tree acceptors and some of their applications
  Journal of Computer and System Sciences, 1970
• Decision problems of finite automata design and related arithmetics
  Transactions of the American Mathematical Society, 1961
• Weak Second‐Order Arithmetic and Finite Automata
  Mathematical Logic Quarterly, 1960