Pages that link to "Item:Q3065609"
From MaRDI portal
The following pages link to UNDECIDABILITY BOUNDS FOR INTEGER MATRICES USING CLAUS INSTANCES (Q3065609):
Displayed 22 items.
- Remarks concerning the freeness problem over morphism and matrix semigroups. (Q300262) (← links)
- On the decidability and complexity of problems for restricted hierarchical hybrid systems (Q338386) (← links)
- Products of matrices and recursively enumerable sets (Q473201) (← links)
- On the membership of invertible diagonal and scalar matrices (Q870838) (← links)
- Solving difference equations whose coefficients are not transcendental (Q935167) (← links)
- Reachability problems in quaternion matrix and rotation semigroups (Q958311) (← links)
- Vector and scalar reachability problems in \(\operatorname{SL}(2, \mathbb{Z})\) (Q1740664) (← links)
- Weighted automata on infinite words in the context of attacker-defender games (Q2013554) (← links)
- Reachability problems in low-dimensional nondeterministic polynomial maps over integers (Q2051802) (← links)
- On injectivity of quantum finite automata (Q2229947) (← links)
- On Post correspondence problem for letter monotonic languages (Q2271434) (← links)
- Freeness properties of weighted and probabilistic automata over bounded languages (Q2280319) (← links)
- Unique decipherability in formal languages (Q2283038) (← links)
- On undecidability bounds for matrix decision problems (Q2474220) (← links)
- Improved matrix pair undecidability results (Q2641877) (← links)
- The Invariance Problem for Matrix Semigroups (Q2811359) (← links)
- On the decidability of semigroup freeness (Q2905326) (← links)
- Matrix Semigroup Freeness Problems in SL $$(2,\mathbb {Z})$$ (Q2971140) (← links)
- ON THE UNDECIDABILITY OF THE IDENTITY CORRESPONDENCE PROBLEM AND ITS APPLICATIONS FOR WORD AND MATRIX SEMIGROUPS (Q3069735) (← links)
- Post Correspondence Problem and Small Dimensional Matrices (Q3637212) (← links)
- On Nonnegative Integer Matrices and Short Killing Words (Q4992844) (← links)
- (Q5002819) (← links)
