The translation power of top-down tree-to-graph transducers (Q1337465): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Controlled iteration grammars and full hyper-AFL's / rank
 
Normal rank
Property / cites work
 
Property / cites work: Translations on a context free grammar / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Syntax Directed Translation, Tree Transducers, and Linear Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph expressions and graph rewritings / 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: Fundamental properties of infinite trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An axiomatic definition of context-free rewriting and its application to NLC graph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3830540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving termination with multiset orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The string generating power of context-free hypergraph 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: Bottom-up and top-down tree transformations— a comparison / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surface tree languages and parallel derivation trees / 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: Q3711773 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of boundary graph grammars and context-free hypergraph grammars / 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: High level tree transducers and iterated pushdown tree transducers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3925893 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Top-down tree transducers with deterministic top-down look-ahead / rank
 
Normal rank
Property / cites work
 
Property / cites work: TOL schemes and control sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4179852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyperedge replacement: grammars and languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3774975 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3486869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A syntax directed compiler for ALGOL 60 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantics of context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3670604 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3789084 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of graph languages generated by hyperedge replacement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3786030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mappings and grammars on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized sequential machine maps / 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

Revision as of 09:15, 23 May 2024

scientific article
Language Label Description Also known as
English
The translation power of top-down tree-to-graph transducers
scientific article

    Statements

    The translation power of top-down tree-to-graph transducers (English)
    0 references
    0 references
    0 references
    4 December 1994
    0 references
    top-down tree-to-graph transducer
    0 references
    hypergraph
    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