A comparison of tree transductions defined by monadic second order logic and by attribute grammars
From MaRDI portal
(Redirected from Publication:1582010)
Recommendations
- Macro tree transducers, attribute grammars, and MSO definable tree translations.
- Monadic Datalog Tree Transducers
- scientific article; zbMATH DE number 3858450
- A characterization of attributed tree transformations by a subclass of macro tree transducers
- Macro Tree Translations of Linear Size Increase are MSO Definable
Cites work
- scientific article; zbMATH DE number 3854429 (Why is no real title available?)
- scientific article; zbMATH DE number 3858450 (Why is no real title available?)
- scientific article; zbMATH DE number 3874572 (Why is no real title available?)
- scientific article; zbMATH DE number 3740783 (Why is no real title available?)
- scientific article; zbMATH DE number 17539 (Why is no real title available?)
- scientific article; zbMATH DE number 177441 (Why is no real title available?)
- scientific article; zbMATH DE number 1200800 (Why is no real title available?)
- scientific article; zbMATH DE number 1037482 (Why is no real title available?)
- scientific article; zbMATH DE number 1086493 (Why is no real title available?)
- scientific article; zbMATH DE number 1142314 (Why is no real title available?)
- scientific article; zbMATH DE number 1142315 (Why is no real title available?)
- scientific article; zbMATH DE number 1995128 (Why is no real title available?)
- scientific article; zbMATH DE number 809155 (Why is no real title available?)
- scientific article; zbMATH DE number 234035 (Why is no real title available?)
- A regular characterization of graph languages definable in monadic second-order logic
- Algebraic automata and context-free sets
- Attribute grammars and recursive program schemes. I. II
- Attribute grammars. Definitions, systems and bibliography
- Attributed tree transducers cannot induce all deterministic bottom-up tree transformations
- Composition and evaluation of attribute coupled grammars
- Context-free hypergraph grammars have the same term-generating power as attribute grammars
- Decision Problems of Finite Automata Design and Related Arithmetics
- Easy problems for tree-decomposable graphs
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Handbook of Graph Grammars and Computing by Graph Transformation
- Handle-rewriting hypergraph grammars
- Increasing modularity and language-independency in automatically generated compilers
- Joint COMPUGRAPH/ SEMAGRAPH workshop on Graph rewriting and computation (SEGRAGRA '95). Selected papers from the workshop, Volterra, Italy, August 28 - September 1, 1995
- Logical description of context-free graph languages
- Macro tree transducers
- Macro tree transducers, attribute grammars, and MSO definable tree translations.
- Monadic second-order definable graph transductions: a survey
- Monadic second-order evaluations on tree-decomposable graphs
- Parallel and two-way automata on directed ordered acyclic graphs
- Semantics of context-free languages
- Synthesized and inherited functions. A new computational model for syntax-directed semantics
- The formal power of one-visit attribute grammars
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
- The monadic second-order logic of graphs. XIII: Graph drawings with edge crossings
- Top-down tree transducers with regular look-ahead
- Translations on a context free grammar
- Tree acceptors and some of their applications
- Tree transducers with external functions
- Tree transducers, L systems, and two-way machines
- Weak Second‐Order Arithmetic and Finite Automata
Cited in
(31)- Weighted tree automata and weighted logics
- scientific article; zbMATH DE number 3858450 (Why is no real title available?)
- Monadic Datalog Tree Transducers
- Streamable regular transductions
- RESEARCH FRONTIERS OF MEMBRANE COMPUTING: OPEN PROBLEMS AND RESEARCH TOPICS
- scientific article; zbMATH DE number 7559409 (Why is no real title available?)
- The equivalence problem for deterministic MSO tree transducers is decidable
- Macro tree transducers, attribute grammars, and MSO definable tree translations.
- Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity
- Recognizability, hypergraph operations, and logical types
- GETGRATS: a summary of scientific results (with annotated bibliography)
- Characterizing attributed tree translations in terms of macro tree transducers
- STACS 2004
- Determinacy and rewriting of functional top-down and MSO tree transformations
- XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles
- Deciding whether an attributed translation can be realized by a top-down transducer
- Definable transductions and weighted logics for texts
- Extended multi bottom-up tree transducers
- scientific article; zbMATH DE number 7559390 (Why is no real title available?)
- Storage-to-tree transducers with look-ahead
- COMPUTING BY COMMUNICATION IN NETWORKS OF MEMBRANES
- A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage
- Decision problems of tree transducers with origin
- 10th Asian Logic Conference
- A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead
- On the power of tree-walking automata.
- Balancedness of MSO transductions in polynomial time
- Tree transformations and dependencies
- Attributed tree transducers for partial functions
- Distributional Learning and Context/Substructure Enumerability in Nonlinear Tree Grammars
- Attribute grammars for unranked trees as a query language for structured documents
This page was built for publication: A comparison of tree transductions defined by monadic second order logic and by attribute grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1582010)
