What makes some language theory problems undecidable (Q2540268)

From MaRDI portal
Revision as of 04:51, 3 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
What makes some language theory problems undecidable
scientific article

    Statements

    title
    What makes some language theory problems undecidable (English)
    0 references
    author
    Juris Hartmanis
    0 references
    John E. Hopcrofts
    0 references
    publication date
    1970
    0 references
    zbMATH Keywords
    languages, automata, networks
    0 references

    Identifiers

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