Solvable problems for transformers with reversal-bounded counters
From MaRDI portal
Publication:3747751
DOI10.1007/BF01078820zbMATH Open0608.68067OpenAlexW2020041969MaRDI QIDQ3747751FDOQ3747751
Authors: A. P. Lisovik 
Publication date: 1985
Published in: Cybernetics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01078820
Recommendations
- scientific article; zbMATH DE number 3894494
- Reversal-Bounded Counter Machines Revisited
- Unboundedness problems for machines with reversal-bounded counters
- Automata with Reversal-Bounded Counters: A Survey
- GENERALIZED COUNTERS AND REVERSAL COMPLEXITY
- Theory and Applications of Models of Computation
- scientific article; zbMATH DE number 3928351
- On reversal bounded alternating Turing machines
- Reversal-bounded nondeterministic multicounter machines and complementation
- scientific article; zbMATH DE number 512847
equivalence problemfunctional equivalencetwo-way deterministic finite automatafinite transformers with reversal-bounded counterslinearly rigid semigroupnonemptiness of a recognizable languagetransformers on marked trees
Cites Work
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- Title not available (Why is that?)
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Title not available (Why is that?)
- The Diophantine Problem for Addition and Divisibility
- Title not available (Why is that?)
- Strict sets and finite semigroup coverings
Cited In (4)
This page was built for publication: Solvable problems for transformers with reversal-bounded counters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3747751)
