Two-way deterministic multi-weak-counter machines

DOI10.1016/0304-3975(82)90086-XMaRDI QIDQ1165028zbMATH OpenFDO

Authors Satoru Miyano

Publication date 1982

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

bounded languagelanguage recognitionsemilinear languagetwo-way deterministic machines

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• scientific article; zbMATH DE number 3628412 (Why is no real title available?)
• A note on semilinear sets and bounded-reversal multihead pushdown automata
• Bounded-reversal multihead finite automata languages
• Counter machines and counter languages
• Finite automata with multiplication
• Multi-stack-counter languages
• On Context-Free Languages
• On tape-bounded complexity classes and multihead finite automata
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Remarks on blind and partially blind one-way multicounter machines
• Remarks on the complexity of nondeterministic counter languages
• Restricted one-counter machines with undecidable universe problems
• Reversal-Bounded Multicounter Machines and Their Decision Problems
• Simple counter machines and number-theoretic problems
• Some open problems in the theory of computation as questions about two-way deterministic pushdown automaton languages
• Two-way pushdown automata

Cited in

(4)

• GENERALIZED COUNTERS AND REVERSAL COMPLEXITY
• On two-way weak counter machines
• Interference automata
• Remarks on two-way automata with weak-counters

This page was built for publication: Two-way deterministic multi-weak-counter machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1165028)