Products of matrices and recursively enumerable sets

DOI10.1016/j.jcss.2014.10.004zbMath1401.03080OpenAlexW2011410600MaRDI QIDQ473201

Juha Honkala

Publication date: 24 November 2014

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2014.10.004

zbMATH Keywords

decidabilityrecursively enumerable setmatrixRice's theoremDiophantine representation

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Algebraic systems of matrices (15A30) Recursively (computably) enumerable sets and degrees (03D25)

Related Items (4)

On the Identity Problem for the Special Linear Group and the Heisenberg Group. ⋮ Quasi-universal \(k\)-regular sequences ⋮ On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond ⋮ On the Mortality Problem: From Multiplicative Matrix Equations to Linear Recurrence Sequences and Beyond

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the membership of invertible diagonal and scalar matrices
• On finite semigroups of matrices
• The freeness problem over matrix semigroups and bounded languages
• On the decidability of semigroup freeness
• UNDECIDABILITY BOUNDS FOR INTEGER MATRICES USING CLAUS INSTANCES
• Polynomial-time algorithm for the orbit problem
• MATRIX EQUATIONS AND HILBERT'S TENTH PROBLEM
• ON THE UNDECIDABILITY OF FREENESS OF MATRIX SEMIGROUPS
• Unsolvability in 3 × 3 Matrices
• ON THE UNDECIDABILITY OF THE FREENESS OF INTEGER MATRIX SEMIGROUPS

This page was built for publication: Products of matrices and recursively enumerable sets