COMPUTATIONAL COMPLEXITY OF TERM-EQUIVALENCE (Q3839875)

From MaRDI portal
Revision as of 17:42, 5 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
COMPUTATIONAL COMPLEXITY OF TERM-EQUIVALENCE
scientific article

    Statements

    title
    COMPUTATIONAL COMPLEXITY OF TERM-EQUIVALENCE (English)
    0 references
    author
    Clifford Bergman
    0 references
    David W. Juedes
    0 references
    Giora Slutzki
    0 references
    publication date
    20 January 2000
    0 references
    zbMATH Keywords
    alternating Turing machine
    0 references
    tree automata
    0 references
    clone
    0 references
    term-equivalence
    0 references
    exponential time
    0 references

    Identifiers

    zbMATH DE Number
    1186370
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3839875&oldid=17441001"
    Powered by MediaWiki