A comparison of tree transductions defined by monadic second order logic and by attribute grammars
type: Item
instance of: scholarly article
title: A comparison of tree transductions defined by monadic second order logic and by attribute grammars
zbMATH Open document ID: 0960.68086
author: Roderick Bloem
author: Joost Engelfriet
published in: Journal of Computer and System Sciences
publication date: 2000-10-10T00:00:00Z
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1515681
zbMATH Keywords: tree transductions
zbMATH Keywords: MSO graph transducer
zbMATH Keywords: attributed tree transducer
MaRDI profile type: Publication
OpenAlex ID: W2056445915
cites work: Translations on a context free grammar
cites work: Easy problems for tree-decomposable graphs
cites work: Q4362731
cites work: Weak Second‐Order Arithmetic and Finite Automata
cites work: Joint COMPUGRAPH/ SEMAGRAPH workshop on Graph rewriting and computation (SEGRAGRA '95). Selected papers from the workshop, Volterra, Italy, August 28 - September 1, 1995
cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
cites work: Q4385531
cites work: The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
cites work: Monadic second-order definable graph transductions: a survey
cites work: The monadic second-order logic of graphs. XIII: Graph drawings with edge crossings
cites work: Q4852905
cites work: Handle-rewriting hypergraph grammars
cites work: Attribute grammars and recursive program schemes. I. II
cites work: Monadic second-order evaluations on tree-decomposable graphs
cites work: Attribute grammars. Definitions, systems and bibliography
cites work: Tree acceptors and some of their applications
cites work: Q4431346
cites work: Decision Problems of Finite Automata Design and Related Arithmetics
cites work: Top-down tree transducers with regular look-ahead
cites work: Q3326871
cites work: Q3340111
cites work: Q4037316
cites work: A regular characterization of graph languages definable in monadic second-order logic
cites work: Q3974863
cites work: The formal power of one-visit attribute grammars
cites work: Context-free hypergraph grammars have the same term-generating power as attribute grammars
cites work: Macro tree transducers, attribute grammars, and MSO definable tree translations.
cites work: Logical description of context-free graph languages
cites work: Handbook of Graph Grammars and Computing by Graph Transformation
cites work: Tree transducers, L systems, and two-way machines
cites work: Macro tree transducers
cites work: Tree transducers with external functions
cites work: Q3925893
cites work: Attributed tree transducers cannot induce all deterministic bottom-up tree transformations
cites work: Q4210160
cites work: Increasing modularity and language-independency in automatically generated compilers
cites work: Q3323279
cites work: Composition and evaluation of attribute coupled grammars
cites work: Parallel and two-way automata on directed ordered acyclic graphs
cites work: Semantics of context-free languages
cites work: Synthesized and inherited functions. A new computational model for syntax-directed semantics
cites work: Q4345251
cites work: Algebraic automata and context-free sets
cites work: Q5287535
cites work: Generalized finite automata theory with an application to a decision problem of second-order logic
cites work: Q4385530
DOI: 10.1006/JCSS.1999.1684
description: scientific article; zbMATH DE number 1515681