Small universal register machines
Theoretical Computer Science - Special issue on universal machines and computations
Undecidable verification problems for programs with unreliable channels
Information and Computation
Multiplicative equations over commuting matrices
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Introduction to the Theory of Computation: Preliminary Edition
Introduction to the Theory of Computation: Preliminary Edition
On the presence of periodic configurations in Turing machines and in counter machines
Theoretical Computer Science
Decision problems for semi-Thue systems with a few rules
Theoretical Computer Science - Insightful theory
Computation: finite and infinite machines
Computation: finite and infinite machines
In time alone: on the computational power of querying the history
TIME '06 Proceedings of the Thirteenth International Symposium on Temporal Representation and Reasoning
Computation in one-dimensional piecewise maps and planar pseudo-billiard systems
UC'05 Proceedings of the 4th international conference on Unconventional Computation
From post systems to the reachability problems for matrix semigroups and multicounter automata
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Lowering undecidability bounds for decision questions in matrices
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Reachability problems in quaternion matrix and rotation semigroups
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Reachability problems in quaternion matrix and rotation semigroups
Information and Computation
The Identity Correspondence Problem and Its Applications
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
On the Computational Complexity of Matrix Semigroup Problems
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
| Hi-index | 0.00 |
In this paper we provide several new results concerning word and matrix semigroup problems using counter automaton models. As a main result, we prove a new version of Post's correspondence problem to be undecidable and show its application to matrix semigroup problems, such as Any Diagonal Matrix Problem and Recurrent Matrix Problem. We also use infinite periodic traces in counter automaton models to show the undecidability of a new variation of the Infinite Post Correspondence Problem and Vector Ambiguity Problem for matrix semigroups.