Polynomial-time algorithm for the orbit problem
Journal of the ACM (JACM)
On the progress of communication between two finite state machines
Information and Control
Frontier between decidability and undecidability: a survey
Theoretical Computer Science - Special issue on universal machines and computations
Concrete Mathematics: A Foundation for Computer Science
Concrete Mathematics: A Foundation for Computer Science
Conter Machines: Decidable Properties and Applications to Verification Problems
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Reset Nets Between Decidability and Undecidability
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Decidability of Reachability Problems for Classes of Two Counters Automata
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Well-abstracted transition systems: application to FIFO automata
Information and Computation
Decision Problems for Semi-Thue Systems with a Few Rules
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Computation: finite and infinite machines
Computation: finite and infinite machines
Survey A survey of computational complexity results in systems and control
Automatica (Journal of IFAC)
On the membership of invertible diagonal and scalar matrices
Theoretical Computer Science
On undecidability bounds for matrix decision problems
Theoretical Computer Science
Periodic and infinite traces in matrix semigroups
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
On the membership of invertible diagonal matrices
DLT'05 Proceedings of the 9th 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
| Hi-index | 0.00 |
The main result of this paper is the reduction of PCP(n) to the vector reachability problem for a matrix semigroup generated by n 4 × 4 integral matrices. It follows that the vector reachability problem is undecidable for a semigroup generated by 7 integral matrices of dimension 4. The question whether the vector reachability problem is decidable for n = 2 and n = 3 remains open. Also we show that proposed technique can be applied to Post’s tag-systems. As a result we define new classes of counter automata that lie on the border between decidability and undecidability.