Equivalence problem for finitely iterated counter machines (Q3910027)

From MaRDI portal
Revision as of 12:13, 13 June 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
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=34651301"
    Powered by MediaWiki