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

From MaRDI portal
Revision as of 10:57, 2 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    OpenAlex ID
    W2059690576
    0 references
    arXiv ID
    cs/0506014
    0 references
    cites work
    Q4714446
    0 references
    Q3906457
    0 references
    Q4210160
    0 references
    Q5576254
    0 references
    Q4185831
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q845868&oldid=35150162"
    Powered by MediaWiki