From post systems to the reachability problems for matrix semigroups and multicounter automata

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

Volumn 3340, Issue , 2004, Pages 345-356

  Potapov, Igor ^a  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY;

% REDUCTIONS; COUNTER AUTOMATA; INTEGRAL MATRICES; MATRIX SEMIGROUPS; REACHABILITY PROBLEM; SEMIGROUPS; TAG SYSTEMS; UNDECIDABILITY; SEMI-GROUP;

COMPUTABILITY AND DECIDABILITY; MATRIX ALGEBRA;

EID: 26444490481     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30550-7_29     Document Type: Article

References (19)

1. J. Bestel and J. Karhumaki. Combinatorics on Words - A Tutorial, Bulletin of the EATCS, February 2003, 178-228
2. V. Blondel and J. Tsitsiklis. A survey of computational complexity results in systems and control. Automatica, 36, 2000, 1249-1274
3. H. Comon and Y. Jurski. Multiple counters automata, safety analysis and Presburger arithmetic, Research Report LSV-98-1, Mar.,1998.
4. C. Dudourd, A. Finkel and Ph. Schnoebelen. Resets nets between decidability and undecidability. In Proc. 25th Int. Coll. Automata, Languages and Programming, LNCS 1443, 1998, 103-115
5. A. Finkel and G. Sutre. Decidability of reachability problems for classes of two counters automata. 17th Ann. Symp. Theoretical Aspects of Computer Science (STAGS'2000), Lille, France, Feb. 2000, volume 1770 of Lecture Notes in Computer Science, 2000, 346-357
6. Alain Finkel, S. Purushothaman Iyer, G. Sutre. Well-abstracted transition systems: application to FIFO automata. Inf. Comput. 181(1), 2003, 1-31
7. S. Gaubert and R. Katz. Reachability problems for products of matrices in semirings. arXiv:math.OC/0310028, v1. 2003, 1-21
8. R. Graham, D. Knuth, O. Patashnik. Concrete Mathematics. 2nd edition, Addison-Wesley, 1994
9. M. Gouda, E. Manning, Y. Yu. On the progress of communication between two finite state machines. Information and control, 63, 1984, 200-216
10. Brian Hayes. On the Teeth of Wheels. American Scientist, Volume 88, Number 4, July-August, 2000, 296-300
11. O. H. Ibarra, J. Su, T. Bultan, Z. Dang, and R. A. Kemmerer. Counter Machines: Decidable Properties and Applications to Verification Problems. MFCS, LNCS 1893, 2000, 426-435
12. 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
13. O. Kurganskyy, I. Potapov. On the bound of algorithmic resolvability of correctness problems of automaton interaction through communication channels. Cybernetics and System Analysis, 3, 1999, 49-57
14. A. Lisitsa, I. Potapov. Membership and reachability problems for row-monomial transformations. MFCS, 2004, 623-634
15. Maurice Mergenstern. Frontier between decidability and undecidability: a survey. Theoretical Computer Science, v.231, 2000, 217-251
16. Yu. V. Matiyasevich, G. Senizergues. Decision problems for semi-Thue systems with a few rules, Proc. LICS'96, 1996, 523-531
17. M. Minsky. Computation: Finite and Infinite Machines. Englewood Cliffs, N.J.: Prentice-Hall, 1967
18. C. Moore. Unpredictability and Undecidability in Dynamical Systems, Physical Review Letters, Vol.64, N. 20, 1990, 2354-2357
19. H. Wang. Tag Systems and Lag Systems. Math. Ann. 152, 1963, 65-74