Unsolvability in 3 × 3 Matrices
From MaRDI portal
Cited in
(78)- Theory of general linear automata
- On synchronizing unambiguous automata
- Sets of matrices all infinite products of which converge
- Program schemata as automata. I
- Deterministic one-counter automata
- ``Natural properties of flowchart step-counting measures
- Modifications of the program scheme model
- Another representation of finite transducers over real numbers
- Examples of undecidable problems for 2-generator matrix semigroups
- The Lyapunov exponent and joint spectral radius of pairs of matrices are hard - when not impossible - to compute and to approximate
- Flatness and structural analysis as a constructive framework for private communication
- Rank of a finite automaton
- On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond
- On injectivity of quantum finite automata
- On Post correspondence problem for letter monotonic languages
- Freeness properties of weighted and probabilistic automata over bounded languages
- Finding binomials in polynomial ideals
- On undecidability bounds for matrix decision problems
- Minimal zero words for second-order matrices
- Positivity of second order linear recurrent sequences
- Regular expressions and the equivalence of programs
- Equivalences on program schemes
- Translating recursion equations into flow charts
- Subrecursive program schemata I P II. I: Undecidable equivalence problems. II: Decidable equivalence problems
- Characterization of flowchartable recursions
- Improved matrix pair undecidability results
- When is a pair of matrices mortal?
- On the decidability of semigroup freeness.
- Undecidability bounds for integer matrices using Claus instances
- Uniformity of Lyapunov exponents for non-invertible matrices
- Post Correspondence Problem and Small Dimensional Matrices
- Matrix Mortality and the Černý-Pin Conjecture
- An unsolvable problem with products of matrices
- A Collatz-type conjecture on the set of rational numbers
- Some decision problems on integer matrices
- Products of matrices and recursively enumerable sets
- On Nonnegative Integer Matrices and Short Killing Words
- On the Identity Problem for the Special Linear Group and the Heisenberg Group.
- Generic complexity of the membership problem for semigroups of integer matrices
- On Affine Reachability Problems
- On finite monoids over nonnegative integer matrices and short killing words
- On Reachability Problems for Low-Dimensional Matrix Semigroups
- Acceptance Ambiguity for Quantum Automata
- On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond
- On the length of uncompletable words in unambiguous automata
- scientific article; zbMATH DE number 7204378 (Why is no real title available?)
- A linear bound on the \(k\)-rendezvous time for primitive sets of NZ matrices
- Freeness problem for matrix semigroups of Parikh matrices
- Continuity properties of the lower spectral radius
- Rational subsets of unitriangular groups.
- Cocyclic subshifts from Diophantine equations
- Mortality Problem for 2×2 Integer Matrices
- REACHABILITY PROBLEMS FOR PRODUCTS OF MATRICES IN SEMIRINGS
- Synchronizing Sequences for Probabilistic Automata
- The Synchronizing Probability Function for Primitive Sets of Matrices
- A survey of computational complexity results in systems and control
- The membership problem for subsemigroups of \(\operatorname{GL}_2(\mathbb{Z})\) is \textbf{NP}-complete
- On simulating Turing machines with matrix semigroups with integrality tests
- Many bounded versions of undecidable problems are \textsf{NP}-hard
- Quantum temporal logic and reachability problems of matrix semigroups
- On the identity and group problems for complex Heisenberg matrices
- Decidability of membership problems for flat rational subsets of \(\mathrm{GL}(2,\mathbb{Q})\) and singular matrices
- Semigroup intersection problems in the Heisenberg groups
- Decidability of multiplicative matrix equations and related Diophantine problems
- Undecidability in physics: a review
- Undecidability of the stabilizer and zero-in-the-corner problems for matrix groups
- Complexity results for a cops and robber game on directed graphs
- On strongest algebraic program invariants
- Monoids of upper triangular matrices over the Boolean semiring
- Efficiently computing the minimum rank of a matrix in a monoid of zero-one matrices
- The complexity of reachability problems in strongly connected finite automata
- Probabilistic finite automaton emptiness is undecidable for a fixed automaton
- Constructive solution of the common invariant cone problem
- On word representations and embeddings in complex matrices
- On the membership of invertible diagonal and scalar matrices
- Mortality problem and affine automata
- Reachability problems in quaternion matrix and rotation semigroups
- Positivity of third order linear recurrence sequences
This page was built for publication: Unsolvability in 3 × 3 Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5579491)
