Reachability Problems for Products of Matrices in Semirings

We consider the following matrix reachability problem: given r square matrices with entries in a semiring, is there a product of these matrices which attains a prescribed matrix? Similarly, we define the vector (resp. scalar) reachability problem, by requiring that the matrix product, acting by right multiplication on a prescribed row vector, gives another prescribed row vector (resp. when multiplied on the left and right by prescribed row and column vectors, gives a prescribed scalar). We show that over any semiring, scalar reachability reduces to vector reachability which is equivalent to matrix reachability, and that for any of these problems, the specialization to any r ≥ 2 is equivalent to the specialization to r = 2. As an application of these reductions and of a theorem of Krob, we show that when r = 2, the vector and matrix reachability problems are undecidable over the max-plus semiring (ℤ∪{-∞}, max,+). These reductions also improve known results concerning the classical zero corner problem. Finally, we show that the matrix, vector, and scalar reachability problems are decidable over semirings whose elements are "positive", like the tropical semiring (ℤ∪{+∞}, min,+).

[1]  Imre Simon,et al.  Limited subsets of a free monoid , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[2]  S. Gaubert.  Performance evaluation of (max, +) automata , 1995, IEEE Trans. Autom. Control..

[3]  Imre Simon,et al.  Recognizable Sets with Multiplicities in the Tropical Semiring , 1988, MFCS.

[4]  Daniel Krob,et al.  The Equality Problem for Rational Series with Multiplicities in the tropical Semiring is Undecidable , 1992, Int. J. Algebra Comput..

[5]  Daniel Krob,et al.  A Complete System of Identities for One-Letter Rational Expressions with Multiplicities in the Tropical Semiring , 1994, Theor. Comput. Sci..

[6]  Imre Simon.  The Nondeterministic Complexity of a Finite Automaton , 1987 .

[7]  J. Pin.  Tropical Semirings , 2005 .

[8]  Jean-Paul Mascle.  Torsion Matrix Semigroups and Recognizable Transductions , 1986, ICALP.

[9]  Yuri Matiyasevich,et al.  Hilbert’s tenth problem , 2019, 100 Years of Math Milestones.

[10]  Christian Choffrut,et al.  Minimizing subsequential transducers: a survey , 2003, Theor. Comput. Sci..

[11]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[12]  Jin-Yi Cai,et al.  Multiplicative equations over commuting matrices , 1996, SODA '96.

[13]  R. Stanley.  What Is Enumerative Combinatorics , 1986 .

[14]  Olivier Bournez,et al.  The Mortality Problem for Matrices of Low Dimensions , 2002, Theory of Computing Systems.

[15]  Jean Mairesse,et al.  Asymptotic analysis of heaps of pieces and application to timed Petri nets , 1999, Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331).

[16]  Kosaburo Hashiguchi,et al.  Limitedness Theorem on Finite Automata with Distance Functions , 1982, J. Comput. Syst. Sci..

[17]  Jean Mairesse,et al.  Modeling and analysis of timed Petri nets using heaps of pieces , 1997, 1997 European Control Conference (ECC).

[18]  M. Paterson.  Unsolvability in 3 × 3 Matrices , 1970 .

[19]  Kosaburo Hashiguchi,et al.  Improved Limitedness Theorems on Finite Automata with Distance Functions , 1990, Theor. Comput. Sci..

[20]  Jean Berstel,et al.  Rational series and their languages , 1988, EATCS monographs on theoretical computer science.

[21]  Richard J. Lipton,et al.  The Complexity of the A B C Problem , 2000, SIAM J. Comput..

[22]  Albert Benveniste,et al.  Algebraic Techniques for Timed Systems , 1998, CONCUR.

[23]  John N. Tsitsiklis,et al.  When is a Pair of Matrices Mortal? , 1997, Inf. Process. Lett..

[24]  Juhani Karhumäki,et al.  Examples of Undecidable Problems for 2-Generator Matrix Semigroups , 1998, Theor. Comput. Sci..

[25]  J. Pin.  Idempotency: Tropical semirings , 1998 .

[26]  Daniel Krob.  Some consequences of a Fatou property of the tropical semiring , 1994 .

[27]  Yuri V. Matiyasevich,et al.  Decision problems for semi-Thue systems with a few rules , 2005, Theor. Comput. Sci..

[28]  P. Moller.  Théorie algébrique des systèmes à évènements discrets , 1988 .

[29]  John N. Tsitsiklis,et al.  A survey of computational complexity results in systems and control , 2000, Autom..

[30]  Zohar Manna,et al.  Mathematical Theory of Computation , 2003 .

[31]  V. Kolokoltsov,et al.  Idempotent Analysis and Its Applications , 1997 .

[32]  Stéphane Gaubert,et al.  Rational series over dioids and discrete event systems , 1994 .

[33]  Imre Simon,et al.  On Semigroups of Matrices over the Tropical Semiring , 1994, RAIRO Theor. Informatics Appl..

[34]  Richard J. Lipton,et al.  Polynomial-time algorithm for the orbit problem , 1986, JACM.

[35]  Willi Hock,et al.  Lecture Notes in Economics and Mathematical Systems , 1981 .

[36]  G. Lallement.  Semigroups and combinatorial applications , 1979 .

[37]  J. Mairesse,et al.  Idempotency: Task resource models and (max, +) automata , 1998 .

[38]  Mehryar Mohri,et al.  Finite-State Transducers in Language and Speech Processing , 1997, CL.

[39]  S. Gaubert.  On the burnside problem for semigroups of matrices in the (max,+) algebra , 1996 .

[40]  Ricardo D. Katz,et al.  Reachability and Invariance Problems in Max-plus Algebra , 2003, POSTA.

[41]  Hing Leung.  Limitedness Theorem on Finite Automata with Distance Functions: An Algebraic Proof , 1991, Theor. Comput. Sci..

[42]  Tero Harju,et al.  Mortality in Matrix Semigroups , 2001, Am. Math. Mon..

[43]  S. Gaubert.  On the burnside problem for semigroups of matrices in the (max, +) algebra , 1996 .