On Markov's undecidability theorem for integer matrices.
DOI10.1007/S00233-007-0714-XzbMATH Open1131.20042OpenAlexW1985893106MaRDI QIDQ2460065FDOQ2460065
Authors: Vesa Halava, Tero Harju
Publication date: 14 November 2007
Published in: Semigroup Forum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00233-007-0714-x
Recommendations
Semigroups of transformations, relations, partitions, etc. (20M20) Algebraic systems of matrices (15A30) Free semigroups, generators and relations, word problems (20M05) Word problems, etc. in computability and recursion theory (03D40)
Cited In (12)
- On factorizations of upper triangular nonnegative matrices of order three
- Post Correspondence Problem and Small Dimensional Matrices
- A note on the emptiness of semigroup intersections
- Undecidability in matrices over Laurent polynomials.
- On undecidability bounds for matrix decision problems
- On upper triangular nonnegative matrices.
- Reachability problems in quaternion matrix and rotation semigroups
- Products of matrices and recursively enumerable sets
- Improved matrix pair undecidability results
- Number theory of matrix semigroups
- Semigroup intersection problems in the Heisenberg groups
- Title not available (Why is that?)
This page was built for publication: On Markov's undecidability theorem for integer matrices.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2460065)