Equivalence problem for finitely iterated counter machines (Q3910027): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 21:53, 5 February 2024

scientific article
Language Label Description Also known as
English
Equivalence problem for finitely iterated counter machines
scientific article

    Statements

    Equivalence problem for finitely iterated counter machines (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1980
    0 references
    0 references
    comparison of languages recognizable by deterministic counter machines
    0 references
    standard circuits
    0 references
    Turing machines
    0 references