Equivalence problem for finitely iterated counter machines (Q3910027)

From MaRDI portal
Revision as of 21:53, 5 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Equivalence problem for finitely iterated counter machines
scientific article

    Statements

    title
    Equivalence problem for finitely iterated counter machines (English)
    0 references
    DOI
    10.1007/BF01069603
    0 references
    author
    V. N. Red'ko
    0 references
    L. P. Lisovik
    0 references
    published in
    Cybernetics
    0 references
    publication date
    1980
    0 references
    zbMATH DE Number
    3720387
    0 references
    zbMATH Keywords
    comparison of languages recognizable by deterministic counter machines
    0 references
    standard circuits
    0 references
    Turing machines
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3910027&oldid=17568700"
    Powered by MediaWiki