Abstract
In this paper we study the membership and vector reachability problems for labelled transition systems with row-monomial transformations. We show the decidability of these problems for row-monomial martix semigroups over rationals and extend these results to the wider class of matrix semigroups. After that we apply our methods to reachability problems for a class of transition systems which turn out to be equivalent to specific counter machines.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Babai, L., Beals, R., Cai, J., Ivanyos, G., Luks, E.M.: Multiplicative equations over commuting matrices. In: ACM-SIAM symposium on Discrete algorithms, pp. 28–30 (1996)
Bestel, J., Karhumaki, J.: Combinatorics on Words - A Tutorial. Bulletin of the EATCS, 178–228 (February 2003)
Cai, J.-y., Lipton, R.J., Zalcstein, Y.: The complexity of the membership problem for 2-generated commutative semigroups of rational matrices. In: 35th Annual Symposium on Foundations of Computer Science, pp. 135–142 (1994)
Cassaigne, J., Karhumaki, J.: Examples of undecidable problems for 2-generator matrix semigroups. Theoretical Computer Science 204(1), 29–34 (1998)
Comon, H., Jurski, Y.: Multiple counters automata, safety analysis and Presburger arithmetic. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol. 1427, pp. 268–279. Springer, Heidelberg (1998)
Contejean, E., Devie, H.: An efficient algorithm for solving systems of Diophantine equations. Information and Computation 113(1), 143–172 (1994)
Contekean, E., Ajil, F.: Complete Solving of Linear Diophantine Equations and Inequations without Adding Variables. In: Montanari, U., Rossi, F. (eds.) CP 1995. LNCS, vol. 976, pp. 1–17. Springer, Heidelberg (1995)
Clifford, A.H., Preston, G.B.: The algebraic theory of semigroups, vol. I. American Mathematical Society, Providence, Rhode Island (1961)
Esparza, J., Finkel, A., Mayr, R.: On the Verification of Broadacst Protocols. In: Proc. LICS 1999, pp. 352–359 (1999)
Finkel, A., Leroux, J.: How to compose Presburger-accelerations: Applications to broadcast protocols. In: Agrawal, M., Seth, A.K. (eds.) FSTTCS 2002. LNCS, vol. 2556, pp. 145–156. Springer, Heidelberg (2002)
Ginsburg, S.: The Mathematical Theory of Context-Free Languages. McGraw-Hill, New York (1966)
Halava, V., Harju, T.: Mortality in Matrix Semigroups. American Mathematical Monthly 108(7), 649–653 (2001)
Kannan, R., Lipton, R.J.: Polynomial-time algorithm for the orbit problem. Journal of the ACM (JACM) 33(4), 808–821 (1986)
Parikh, R.: On context-free languages. J. ACM 13, 570–581 (1966)
Paterson, M.: Unsolvability in 3 × 3 matrices. Studies in Applied Mathematics 49, 105–107 (1970)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lisitsa, A., Potapov, I. (2004). Membership and Reachability Problems for Row-Monomial Transformations. In: Fiala, J., Koubek, V., Kratochvíl, J. (eds) Mathematical Foundations of Computer Science 2004. MFCS 2004. Lecture Notes in Computer Science, vol 3153. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28629-5_48
Download citation
DOI: https://doi.org/10.1007/978-3-540-28629-5_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22823-3
Online ISBN: 978-3-540-28629-5
eBook Packages: Springer Book Archive