The equivalence problem for deterministic MSO tree transducers is decidable (Q845868): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Translations on a context free grammar / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of tree transductions defined by monadic second order logic and by attribute grammars / 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: On the equivalence problem for attribute systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Equivalence Problem for Single-Valued Two-Way Transducers (on NPDTOL Languages) is Decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: MSO definable string transductions and two-way finite-state transducers / 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: A comparison of pebble tree transducers with macro tree transducers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Macro Tree Translations of Linear Size Increase are MSO Definable / rank
 
Normal rank
Property / cites work
 
Property / cites work: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science / 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: Q3906457 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4210160 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5576254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Algol-Like Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Equivalence Problem for Deterministic Two-Way Sequential Transducers is Decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2DST mappings of languages and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Typechecking for XML transformers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4185831 / rank
 
Normal rank

Latest revision as of 10:57, 2 July 2024

scientific article
Language Label Description Also known as
English
The equivalence problem for deterministic MSO tree transducers is decidable
scientific article

    Statements

    The equivalence problem for deterministic MSO tree transducers is decidable (English)
    0 references
    0 references
    0 references
    29 January 2010
    0 references
    0 references
    formal languages
    0 references
    automata theory
    0 references
    equivalence problem
    0 references
    transducer
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references