Post Correspondence Problem for short words
Information Processing Letters
On computability and some decision problems of parametric weighted finite automata
Journal of Automata, Languages and Combinatorics
Combining widening and acceleration in linear relation analysis
SAS'06 Proceedings of the 13th international conference on Static Analysis
| Hi-index | 0.00 |
This work is a survey on decidable and undecidable problems in matrix theory. The problems studied are simply formulated, however most of them are undecidable. The method to prove undecidabilities is the one found by Paterson [Pat] in 1970 to prove that the mortality of finitely generated matrix monoids is undecidable. This method is based on the undecidability of the Post Correspondence Problem. We shall present a new proof to this mortality problem, which still uses the method of Paterson, but is a bit simpler.