Computations on register machines with counters
From MaRDI portal
Publication:1744355
DOI10.1515/DMA-2018-0010zbMATH Open1390.68417OpenAlexW2970550214WikidataQ130038696 ScholiaQ130038696MaRDI QIDQ1744355FDOQ1744355
Authors: Igor V. Savitskiy
Publication date: 23 April 2018
Published in: Discrete Mathematics and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/dma-2018-0010
Recommendations
Formal languages and automata (68Q45) Recursive functions and relations, subrecursive hierarchies (03D20)
Cites Work
- Title not available (Why is that?)
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- A machine description and the hierarchy of initial Grzegorczyk classes
- Remarks on the complexity of nondeterministic counter languages
- Counter machines and counter languages
- An iterative description of the class \(\mathcal E^1\) of Grzegorczyk's hierarchy
Cited In (7)
- Arithmetization of register machines with counters
- Eliminating inequalities in register machines with counters
- Discovering nontrivial and functional behavior in register machines
- Computations on counter machines with summator
- The Computation of Partial Recursive Word‐Functions Without Read Instructions
- Addition machines, automatic functions and open problems of Floyd and Knuth
- Register machines with counters
This page was built for publication: Computations on register machines with counters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1744355)