The evaluation of first-order substitution is monadic second-order compatible
type: Item
instance of: scholarly article
title: The evaluation of first-order substitution is monadic second-order compatible
zbMATH Open document ID: 0996.68061
DOI: 10.1016/S0304-3975(02)00012-9
author: Teodor Knapik
author: Bruno Courcelle
published in: Theoretical Computer Science
publication date: 2002-07-15T00:00:00Z
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 1767892
zbMATH Keywords: monadic second-order logic
zbMATH Keywords: first-order substitution
zbMATH Keywords: algebraic tree
zbMATH Keywords: hyperalgebraic tree
zbMATH Keywords: decidability of logical theories
MaRDI profile type: Publication
cites work: Q5397484
cites work: Fundamental properties of infinite trees
cites work: Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
cites work: Q4385535
cites work: The monadic second-order logic of graphs. VII: Graphs as relational structures
cites work: Monadic second-order definable graph transductions: a survey
cites work: The monadic second-order logic of graphs. IX: Machines and their behaviours
cites work: Handle-rewriting hypergraph grammars
cites work: Q4164787
cites work: Upper bounds to the clique width of graphs
cites work: Monadic second-order logic, graph coverings and unfoldings of transition systems
cites work: The IO- and OI-hierarchies
cites work: Q4954439
cites work: Program transformations and algebraic semantics
cites work: Q3738547
cites work: Q2778825
cites work: Decidability of Second-Order Theories and Automata on Infinite Trees
cites work: Q4714446
description: scientific article; zbMATH DE number 1767892