Membership and reachability problems for row-monomial transformations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3153, Issue , 2004, Pages 623-634

  Lisitsa, Alexei ^a   Potapov, Igor ^a  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

COUNTER MACHINES; LABELLED TRANSITION SYSTEMS; MATRIX SEMIGROUPS; REACHABILITY PROBLEM; SEMIGROUPS; TRANSITION SYSTEM;

EQUIVALENCE CLASSES;

EID: 26444466516     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28629-5_48     Document Type: Article

References (15)

1. L. Babai, R. Beals, J. Cai, G. Ivanyos, E. M. Luks Multiplicative equations over commuting matrices. ACM-SIAM symposium on Discrete algorithms, (1996) 28-30
2. J.Bestel and Karhumaki. Combinatorics on Words - A Tutorial, Bulletin of the EATCS, February (2003) 178 - 228
3. Jin-yi Cai, Richard J. Lipton, and Yechezkel Zalcstein. The complexity of the membership problem for 2-generated commutative semigroups of rational matrices. In 35th Annual Symposium on Foundations of Computer Science (1994) 135-142
4. J. Cassaigne and J. Karhumaki. Examples of undecidable problems for 2-generator matrix semigroups. Theoretical Computer Science, 204(1), (1998) 29-34
5. H. Comon and Y. Jurski. Multiple counters automata, safety analysis and Pres-burger arithmetic. CAV'98, LNCS 1427, (1998) 268-279
6. E. Contejean and H. Devie. An efficient algorithm for solving systems of Diophan-tine equations. Information and Computation, 113(1), (1994) 143-172
7. E. Contekean, F.Ajil. Complete Solving of Linear Diophantine Equations and Inequations without Adding Variables. CP95, LNCS 976, (1995) 1-17
8. J. A.H. Clifford and G.B. Preston. The algebraic theory of semigroups, Volume I, American Mathematical Society, Providence, Rhode Island, (1961)
9. J. Esparza, A.Finkel and R. Mayr. On the Verification of Broadacst Protocols. In Proc. LICS'99 (1999) 352-359
10. A. Finkel and J. Leroux. How to compose Presburger-accelerations: Applications to broadcast protocols. FSTTCS02, LNCS 2556, (2002) 145-156
11. S. Ginsburg. The Mathematical Theory of Context-Free Languages. McGraw-Hill, New York, (1966)
12. V.Halava, T.Harju. Mortality in Matrix Semigroups, American Mathematical Monthly, Vol 108 No. 7, (2001) 649-653
13. R. Kannan and R. J. Lipton. Polynomial-time algorithm for the orbit problem, Journal of the ACM (JACM), Volume 33 , Issue 4, (1986) 808 - 821
14. R. Parikh. On context-free languages, J. ACM, 13, (1966), 570-581
15. M. Paterson. Unsolvability in 3 x 3 matrices. Studies in Applied Mathematics, 49 (1970), 105-107