Two-way deterministic multi-weak-counter machines
type: Item
instance of: scholarly article
title: Two-way deterministic multi-weak-counter machines
zbMATH Open document ID: 0486.68085
DOI: 10.1016/0304-3975(82)90086-X
author: Satoru Miyano
published in: Theoretical Computer Science
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 3765185
zbMATH Keywords: two-way deterministic machines
zbMATH Keywords: bounded language
zbMATH Keywords: semilinear language
zbMATH Keywords: language recognition
MaRDI profile type: Publication
cites work: Multi-stack-counter languages
cites work: Counter machines and counter languages
cites work: Some open problems in the theory of computation as questions about two-way deterministic pushdown automaton languages
cites work: Two-way pushdown automata
cites work: Remarks on the complexity of nondeterministic counter languages
cites work: Remarks on blind and partially blind one-way multicounter machines
cites work: Simple counter machines and number-theoretic problems
cites work: A note on semilinear sets and bounded-reversal multihead pushdown automata
cites work: Reversal-Bounded Multicounter Machines and Their Decision Problems
cites work: Restricted one-counter machines with undecidable universe problems
cites work: Finite automata with multiplication
cites work: Q4190159
cites work: Recursive unsolvability of Post's problem of ''Tag'' und other topics in theory of Turing machines
cites work: On Context-Free Languages
cites work: Bounded-reversal multihead finite automata languages
cites work: On tape-bounded complexity classes and multihead finite automata
description: scientific article; zbMATH DE number 3765185