A comparison of tree transductions defined by monadic second order logic and by attribute grammars (Q1582010): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2056445915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Translations on a context free grammar / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy problems for tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4362731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak Second‐Order Arithmetic and Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / 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 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic second-order definable graph transductions: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. XIII: Graph drawings with edge crossings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4852905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handle-rewriting hypergraph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Attribute grammars and recursive program schemes. I. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic second-order evaluations on tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Attribute grammars. Definitions, systems and bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree acceptors and some of their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4431346 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision Problems of Finite Automata Design and Related Arithmetics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Top-down tree transducers with regular look-ahead / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3326871 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3340111 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037316 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A regular characterization of graph languages definable in monadic second-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3974863 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The formal power of one-visit attribute grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Context-free hypergraph grammars have the same term-generating power as attribute grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Macro tree transducers, attribute grammars, and MSO definable tree translations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical description of context-free graph languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of Graph Grammars and Computing by Graph Transformation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree transducers, L systems, and two-way machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Macro tree transducers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree transducers with external functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3925893 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Attributed tree transducers cannot induce all deterministic bottom-up tree transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4210160 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Increasing modularity and language-independency in automatically generated compilers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3323279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Composition and evaluation of attribute coupled grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel and two-way automata on directed ordered acyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantics of context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synthesized and inherited functions. A new computational model for syntax-directed semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4345251 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic automata and context-free sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5287535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized finite automata theory with an application to a decision problem of second-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385530 / rank
 
Normal rank

Latest revision as of 15:19, 30 May 2024

scientific article
Language Label Description Also known as
English
A comparison of tree transductions defined by monadic second order logic and by attribute grammars
scientific article

    Statements

    A comparison of tree transductions defined by monadic second order logic and by attribute grammars (English)
    0 references
    0 references
    0 references
    10 October 2000
    0 references
    tree transductions
    0 references
    MSO graph transducer
    0 references
    attributed tree transducer
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references