Unsolvability in 3 × 3 Matrices
From MaRDI portal
Publication:5579491
DOI10.1002/sapm1970491105zbMath0186.01103OpenAlexW204546099MaRDI QIDQ5579491
Publication date: 1970
Published in: Studies in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/sapm1970491105
Related Items (61)
When is a pair of matrices mortal? ⋮ On the decidability of semigroup freeness ⋮ Synchronizing Sequences for Probabilistic Automata ⋮ Improved matrix pair undecidability results ⋮ Generic complexity of the membership problem for semigroups of integer matrices ⋮ The Lyapunov exponent and joint spectral radius of pairs of matrices are hard - when not impossible - to compute and to approximate ⋮ On synchronizing unambiguous automata ⋮ On the membership of invertible diagonal and scalar matrices ⋮ Finding binomials in polynomial ideals ⋮ On the length of uncompletable words in unambiguous automata ⋮ The membership problem for subsemigroups of \(\operatorname{GL}_2(\mathbb{Z})\) is \textbf{NP}-complete ⋮ A Collatz-type conjecture on the set of rational numbers ⋮ Products of matrices and recursively enumerable sets ⋮ Flatness and structural analysis as a constructive framework for private communication ⋮ On injectivity of quantum finite automata ⋮ On the Identity Problem for the Special Linear Group and the Heisenberg Group. ⋮ Sets of matrices all infinite products of which converge ⋮ Uniformity of Lyapunov exponents for non-invertible matrices ⋮ Mortality problem and affine automata ⋮ Cocyclic subshifts from Diophantine equations ⋮ A Linear Bound on the k-rendezvous Time for Primitive Sets of NZ Matrices ⋮ On undecidability bounds for matrix decision problems ⋮ Reachability problems in quaternion matrix and rotation semigroups ⋮ Freeness Problem for Matrix Semigroups of Parikh Matrices ⋮ A survey of computational complexity results in systems and control ⋮ Minimal zero words for second-order matrices ⋮ Positivity of third order linear recurrence sequences ⋮ Continuity properties of the lower spectral radius ⋮ Program schemata as automata. I ⋮ Positivity of second order linear recurrent sequences ⋮ Deterministic one-counter automata ⋮ On Post correspondence problem for letter monotonic languages ⋮ Some decision problems on integer matrices ⋮ Freeness properties of weighted and probabilistic automata over bounded languages ⋮ ``Natural properties of flowchart step-counting measures ⋮ Mortality Problem for 2×2 Integer Matrices ⋮ UNDECIDABILITY BOUNDS FOR INTEGER MATRICES USING CLAUS INSTANCES ⋮ Unnamed Item ⋮ Modifications of the program scheme model ⋮ On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond ⋮ Another representation of finite transducers over real numbers ⋮ Regular expressions and the equivalence of programs ⋮ Post Correspondence Problem and Small Dimensional Matrices ⋮ Matrix Mortality and the Černý-Pin Conjecture ⋮ Rank of a finite automaton ⋮ On finite monoids over nonnegative integer matrices and short killing words ⋮ On Affine Reachability Problems ⋮ On Reachability Problems for Low-Dimensional Matrix Semigroups ⋮ On the Mortality Problem: From Multiplicative Matrix Equations to Linear Recurrence Sequences and Beyond ⋮ Acceptance Ambiguity for Quantum Automata ⋮ Equivalences on program schemes ⋮ Examples of undecidable problems for 2-generator matrix semigroups ⋮ REACHABILITY PROBLEMS FOR PRODUCTS OF MATRICES IN SEMIRINGS ⋮ Translating recursion equations into flow charts ⋮ Subrecursive program schemata I P II. I: Undecidable equivalence problems. II: Decidable equivalence problems ⋮ On Nonnegative Integer Matrices and Short Killing Words ⋮ Theory of general linear automata ⋮ Characterization of flowchartable recursions ⋮ Rational subsets of unitriangular groups ⋮ An unsolvable problem with products of matrices ⋮ The Synchronizing Probability Function for Primitive Sets of Matrices
Cites Work
This page was built for publication: Unsolvability in 3 × 3 Matrices
