Products of matrices and recursively enumerable sets
From MaRDI portal
Publication:473201
DOI10.1016/J.JCSS.2014.10.004zbMATH Open1401.03080OpenAlexW2011410600MaRDI QIDQ473201FDOQ473201
Authors: 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
Recommendations
Recursively (computably) enumerable sets and degrees (03D25) Algebraic systems of matrices (15A30) Undecidability and degrees of sets of sentences (03D35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Unsolvability in 3 × 3 Matrices
- On finite semigroups of matrices
- On the decidability of semigroup freeness.
- Undecidability bounds for integer matrices using Claus instances
- Title not available (Why is that?)
- ON THE UNDECIDABILITY OF FREENESS OF MATRIX SEMIGROUPS
- Polynomial-time algorithm for the orbit problem
- MATRIX EQUATIONS AND HILBERT'S TENTH PROBLEM
- The freeness problem over matrix semigroups and bounded languages
- Title not available (Why is that?)
- ON THE UNDECIDABILITY OF THE FREENESS OF INTEGER MATRIX SEMIGROUPS
- On the membership of invertible diagonal and scalar matrices
Cited In (7)
- Title not available (Why is that?)
- On the Identity Problem for the Special Linear Group and the Heisenberg Group.
- 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
- Title not available (Why is that?)
- Generalized recurrence and the nonwandering set for products
- Quasi-universal \(k\)-regular sequences
This page was built for publication: Products of matrices and recursively enumerable sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q473201)
