Vincent Blondel, Vincent Canterini  Home/Search
Context Related
| inma.ucl.ac.be/~blondel/p...01BCpfa.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: inma.ucl.ac.be/~blondel/p...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We prove that several problems associated to probabilistic finite automata are undecidable for automata whose number of input letters and number of states are fixed. As a corollary of one of our results we prove that the problem of determining if the set of all products of two 47 × 47 matrices with nonnegative rational entries is bounded is undecidable. (Update)
Cited by: More
Probabilistic Finite-State Machines - Part I - Vidal, al. (Correct)
Active bibliography (related documents): More All
0.6: On the Undecidability of Probabilistic Planning and.. - Madani, Hanks, Condon (2003) (Correct)
0.5: Remarks on Generalized Post Correspondence Problem - Karhumäki, Krob (1996) (Correct)
0.5: Decidable and Undecidable Problems about Quantum Automata - Blondel, Jeandel, Koiran, .. (Correct)
Similar documents based on text: More All
0.8: The Boundedness of All Products of a Pair of Matrices is.. - Blondel, Tsitsiklis (2000) (Correct)
0.6: On the Undecidability of Probabilistic Planning and.. - Madani, Hanks, Condon (1999) (Correct)
0.5: The presence of a zero in an integer linear recurrent.. - Blondel, Portier (1999) (Correct)
BibTeX entry: (Update)
V. C. V. D. Blondel, "Undecidable problems for probabilistic automata of fixed dimension," Theory of Computing Systems, vol. 36, no. 3, pp. 231--245, 2003. http://citeseer.ist.psu.edu/blondel01undecidable.html More
@misc{ blondel03undecidable,
author = "V. Blondel",
title = "Undecidable problems for probabilistic automata of fixed dimension",
text = "V. C. V. D. Blondel, Undecidable problems for probabilistic automata of
fixed dimension, Theory of Computing Systems, vol. 36, no. 3, pp. 231--245,
2003.",
year = "2003",
url = "citeseer.ist.psu.edu/blondel01undecidable.html" }
Citations (may not include all citations):134 Formal languages and their relation to automata (context) - Hopcroft, Ullman - 1969
104 Automata-theoretic aspects of formal power series (context) - Salomaa, Soittola - 1978
96 The complexity of Markov decision processes (context) - Papadimitriou, Tsitsiklis - 1987
87 Arthur-Merlin games: a randomized proof system (context) - Babai, Moran - 1988
76 The mathematical theory of context-free languages (context) - Ginsburg - 1966
73 Introduction to probabilistic automata (context) - Paz - 1971
67 A variant of a recursively unsolvable problem (context) - Post - 1946
47 A Survey of Computational Complexity Results in Systems and .. - Blondel, Tsitsiklis - 2000
45 Decision problems for semiThue systems with a few rules - Matiyasevich, Senizergues
34 Probabilistic automata (context) - Rabin - 1963
31 Recent results on sturmian words - Berstel - 1996
24 the undecidability of probabilistic planning and infinite-ho.. - Madani, Hanks et al. - 1999
24 When is a pair of matrices mortal - Blondel, Tsitsiklis - 1997
15 Post correspondence problem with lists consisting of two wor.. (context) - Ehrenfeucht, Karhumaki et al. - 1982
13 The boundedness of all products of a pair of matrices is und.. - Blondel, Tsitsiklis - 2000
9 the power of finite automata with both nondeterministic and .. - Condon, Hellerstein et al. - 1998
9 Small universal Turing machines (context) - Rogozhin
8 An overview of planning under uncertainty - Blythe - 1999
5 Some recursively unsolvable problems relating to isolated cu.. (context) - Bertoni, Mauri et al.
4 The solution of problems relative to probabilistic automata .. (context) - Bertoni
3 On some variants of Post's correspondence problem (context) - Ruohonen - 1983
3 Lectures on classical and probabilistic automata (context) - Rabin - 1966
2 Unsolvability in 3 3 matrices (context) - Paterson - 1970
2 Post combinatorial problem with two pairs of words (context) - Pavlenko - 1981
1 Mathematical theory of automata Proc (context) - Rabin - 1967
1 Email dated 8 Feb (context) - Karhumaki - 2001
Documents on the same site (http://www.inma.ucl.ac.be/~blondel/publications/index.html): More
Transcendence in Simultaneous Stabilization - Bertilsson, Blondel (1996) (Correct)
Structured Numbers. Properties of a hierarchy of operations on.. - Blondel (1997) (Correct)
The Simultaneous Stabilizability Question of Three Linear.. - Blondel, Gevers (1992) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC