The equivalence problem for deterministic MSO tree transducers is decidable (Q845868)

From MaRDI portal
Revision as of 11:52, 14 March 2024 by Daniel (talk | contribs) (‎Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710401498911)
scientific article
Language Label Description Also known as
English
The equivalence problem for deterministic MSO tree transducers is decidable
scientific article

    Statements

    title
    The equivalence problem for deterministic MSO tree transducers is decidable (English)
    0 references
    author
    Joost Engelfriet
    0 references
    Sebastian Maneth
    0 references
    publication date
    29 January 2010
    0 references
    zbMATH DE Number
    5664717
    0 references
    zbMATH Keywords
    formal languages
    0 references
    automata theory
    0 references
    equivalence problem
    0 references
    transducer
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q845868&oldid=30890616"
    Powered by MediaWiki