New decidability results concerning two-way counter machines and applications

DOI10.1007/3-540-56939-1_82zbMath1422.68150OpenAlexW1485651606MaRDI QIDQ4630270

Tao Jiang, Nicholas Q. Tran, Oscar H. Ibarra, Hui Wang

Publication date: 29 March 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-56939-1_82

zbMATH Keywords

finite automatonsimple loopequivalence problemcounter machinesimple program

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items

On parametric timed automata and one-counter machines ⋮ Continuous One-counter Automata

Cites Work

• Unnamed Item
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Halting space-bounded computations
• Simple counter machines and number-theoretic problems
• Deterministic one-counter automata
• On two-way weak counter machines
• Two-Way Counter Machines and Diophantine Equations
• Reversal-Bounded Multicounter Machines and Their Decision Problems
• Parametric real-time reasoning

This page was built for publication: New decidability results concerning two-way counter machines and applications