Periodic and Infinite Traces in Matrix Semigroups
From MaRDI portal
Publication:5448643
Automata and formal grammars in connection with logical questions (03D05) Thue and Post systems, etc. (03D03) Algebraic systems of matrices (15A30) Free semigroups, generators and relations, word problems (20M05) Undecidability and degrees of sets of sentences (03D35) Word problems, etc. in computability and recursion theory (03D40)
Recommendations
- Developments in Language Theory
- On the undecidability of the identity correspondence problem and its applications for word and matrix semigroups
- The symmetric Post correspondence problem, and errata for the freeness problem for matrix semigroups
- The Identity Correspondence Problem and Its Applications
- ON THE UNDECIDABILITY OF THE FREENESS OF INTEGER MATRIX SEMIGROUPS
Cited in
(10)- On the undecidability of the identity correspondence problem and its applications for word and matrix semigroups
- Developments in Language Theory
- Freeness properties of weighted and probabilistic automata over bounded languages
- Semi-periodic \infty-tuples
- Reachability problems in quaternion matrix and rotation semigroups
- Relations in the semigroup of \(2\times 2\) upper-triangular matrices
- On injectivity of quantum finite automata
- Acceptance Ambiguity for Quantum Automata
- Matrix semigroup freeness problems in \(\mathrm{SL}(2,\mathbb {Z})\)
- Vector ambiguity and freeness problems in \(\mathrm{SL} (2,\mathbb {Z})\)
This page was built for publication: Periodic and Infinite Traces in Matrix Semigroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5448643)
