Undecidable properties of deterministic top-down tree transducers (Q1341717): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Composition of top-down and bottom-up tree transductions / 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: Tree transducers, L systems, and two-way machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3028362 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4179852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4431392 / 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: Mappings and grammars on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5678435 / rank
 
Normal rank

Latest revision as of 11:14, 23 May 2024

scientific article
Language Label Description Also known as
English
Undecidable properties of deterministic top-down tree transducers
scientific article

    Statements

    Undecidable properties of deterministic top-down tree transducers (English)
    0 references
    9 January 1995
    0 references
    0 references
    top-down tree transducer
    0 references
    term rewriting system
    0 references
    0 references
    0 references