On the complexity of decision problems for counter machines with applications to coding theory

DOI10.1007/978-3-031-05578-2_14OpenAlexW4285298663MaRDI QIDQ2163996

Ian McQuillan, Oscar H. Ibarra

Publication date: 11 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-05578-2_14

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the containment and equivalence problems for two-way transducers
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• The complexity of decision problems for finite-turn multicounter machines
• Generalizations of Code Languages with Marginal Errors
• Duplication in DNA Sequences
• Reversal-Bounded Multicounter Machines and Their Decision Problems
• New Decidability Results Concerning Two-Way Counter Machines
• Stack automata and compiling
• Generalizations of Code Languages with Marginal Errors

This page was built for publication: On the complexity of decision problems for counter machines with applications to coding theory