Undecidable problems for probabilistic automata of fixed dimension

Theory of Computing Systems

Volumn 36, Issue 3, 2003, Pages 231-245

  Blondel, Vincent D ^a   Canterini, Vincent ^a  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

PROBABILISTIC FINITE AUTOMATA (PFA);

COMPUTATIONAL METHODS; DECISION MAKING; MATRIX ALGEBRA; PROBABILITY; PROBLEM SOLVING; THEOREM PROVING;

FINITE AUTOMATA;

EID: 0037931756     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-003-1061-2     Document Type: Article

References (32)

1. [B1] A. Bertoni. The solution of problems relative to probabilistic automata in the frame of the formal languages theory. In Vierte Jahrestagung der Gesellschaft für Informatik, pages 107-112, Berlin, 1974. Lecture Notes in Computer Science, Vol. 26. Springer-Verlag, Berlin, 1975.
2. [B2] J. Blythe. An overview of planning under uncertainty. In Artificial Intelligence Today, pages 85-110. Springer-Verlag, Berlin, 1999.
3. [BM] L. Babai and S. Moran. Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity classes. J. Comput. System Sci., 36:254-276, 1988.
4. [BMT] A. Bertoni, G. Mauri, and M. Torelli. Some recursively unsolvable problems relating to isolated cutpoints in probabilistic automata. In Automata, Languages and Programming, pages 87-94, Fourth Colloq., Univ. Turku, Turku, 1977. Lecture Notes in Computer Science, Vol. 52. Springer-Verlag, Berlin, 1977.
5. [BT1] V. D. Blondel and J. N. Tsitsiklis. When is a pair of matrices mortal? Inform. Process. Lett., 63(5):283-286, 1997.
6. [BT2] V. D. Blondel and J. N. Tsitsiklis. The boundedness of all products of a pair of matrices is undecidable. Systems Control Lett., 41(2):135-140, 2000.
7. [BT3] V. D. Blondel and J. N. Tsitsiklis. A survey of computational complexity results in systems and control. Automatica, 36(9):1249-1274, 2000.
8. [CHPW] A. Condon, L. Hellerstein, S. Pottle, and A. Wigderson. On the power of finite automata with both nondeterministic and probabilistic states. SIAM J. Comput., 27(3):739-762, 1998.
9. [CL] A. Condon and R. J. Lipton. On the complexity of space bounded interactive proofs. In Proceedings of the 29th Annual Symposium on Foundations of Computer Science, pages 462-467, 1989.
10. [EKR] A. Ehrenfeucht, J. Karhumäki, and G. Rozenberg. The (generalized) Post correspondence problem with lists consisting of two words is decidable. Theoret. Comput. Sci., 21(2):119-144, 1982.
11. [G] S. Ginsburg. The Mathematical Theory of Context-Free Languages, XII. McGraw-Hill, New York, 1966.
12. [HH] V. Halava and T. Harju. Infinite solutions of marked Post correspondence problems. In W. Brauer, H. Ehrig, J. Karhumaki, and A. Salomaa (eds.), Formal and Natural Computing Essays Dedicated to Grzegorz Rozenberg, pages 57-68. Lecture Notes in Computer Science, Vol. 2300. Springer-Verlag, Berlin, 2002.
13. [HK] T. Harju and J. Karhumäki. Morphisms. In Handbook of Formal Languages, Vol. 1, pages 439-510. Springer-Verlag, Berlin, 1997.
14. [HU] J. E. Hopcroft and J. D. Ullman. Formal Languages and Their Relation to Automata. Addison-Wesley, Reading, MA, 1969.
15. [J] G. Jacob. La finitude des représentations linéaires de semi-groupes est décidable. J. Algebra, 52:437-459, 1978.
16. [K] J. Karhumäki. Personnel communication. Email dated 8 Feb 2001.
17. [KR] M. Kudlek and Y. Rogozhin. New small universal circular Post machines. In R. Freivalds (ed.). Fundamentals of Computation Theory 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001, pages 217-226. Lecture Notes in Computer Sciences, Vol. 2138. Springer-Verlag, Berlin, 2001.
18. [MHC] O. Madani, S. Hanks, and A. Condon. On the undecidability of probabilistic planning and infinite-horizon partially observable Markov decision problems. In Proceedings of the Sixteenth National Conference on Artificial Intelligence, pages 541-548, 1999.
19. [MS1] A. Mandel and I. Simon. On finite semigroups of matrices. Theoret. Comput. Sci., 5:101-111, 1977.
20. [MS2] Y. Matiyasevich and G. Sénizergues. Decision problems for semi-Thue systems with a few rules. In Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science (New Brunswick, NJ, 1996), pages 523-531. IEEE Computer Society Press, Los Alamitos, CA, 1996.
21. [P1] M. S. Paterson. Unsolvability in 3 × 3 matrices. Stud. Appl. Math., 49:105-107, 1970.
22. [P2] V. A. Pavlenko. The Post combinatorial problem for two pairs of words (in Russian). Akad. Nauk. Ukrain. SSR Inst. Mat. Preprint, 1982(16), 65pp.
23. [P3] A. Paz, Introduction to Probabilistic Automata. Academic Press, New York, 1971.
24. [P4] E. L. Post. A variant of a recursively unsolvable problem. Bull. Amer. Math. Soc., 52:264-268, 1946.
25. [PT] C. H. Papadimitriou and J. N. Tsitsiklis. The complexity of Markov decision processes. Math. Oper. Res., 12(3):441-450, 1987.
26. [R1] M. O. Rabin. Probabilistic automata. Inform. and Control, 6:230-245, 1963.
27. [R2] M. O. Rabin. Lectures on classical and probabilistic automata. In E. R. Caianiello (ed.), Automata Theory. Academic Press, New York, 1966.
28. [R3] M. O. Rabin. Mathematical theory of automata Proc. Sympos. Appl. Math., 19:153-175, 1967.
29. [R4] Y. Rogozhin. Small universal Turing machines. Theoret. Comput. Sci., 168(2):215-240, 1996.
30. [R5] K. Ruohonen. On some variants of Post's correspondence problem. Acta Inform., 19(4):357-367, 1983.
31. [SS] A. Salomaa and M. Soittola. Automata-Theoretic Aspects of Formal Power Series. Texts and Monographs in Computer Science. Springer-Verlag, New York, 1978.
32. [T] P. Turakainen. Generalized automata and stochastic languages. Proc. Amer. Math. Soc., 21:303-309, 1969.