Deciding Equivalence of Finite Tree Automata (Q3477969)

From MaRDI portal
Revision as of 21:36, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Deciding Equivalence of Finite Tree Automata
scientific article

    Statements

    title
    Deciding Equivalence of Finite Tree Automata (English)
    0 references
    author
    Helmut Seidl
    0 references
    publication date
    1990
    0 references
    zbMATH Keywords
    complexity
    0 references
    semirings
    0 references
    equivalence
    0 references
    finite tree automata
    0 references
    ambiguity
    0 references

    Identifiers

    DOI
    10.1137/0219027
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    68Q45
    0 references
    68Q70
    0 references
    20M35
    0 references
    zbMATH DE Number
    4147522
    0 references
    OpenAlex ID
    W2019789808
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3477969&oldid=32002636"
    Powered by MediaWiki