1. A finite state probabilistic automaton that accepts a context sensitive language that is not context free;Chen;Inform. Contr.,1977
2. Enumerable sets are Diophantine;Matijasevic;Soviet Math. Dokl.,1970
3. Some aspects of probabilitic automata;Paz;Inform. Contr.,1966
4. On the languages representable by finite probabilistic automata;Diêu;Z. Math. Logik Grundlagen Math.,1971
5. On nonregular events representable in probabilistic automata with one input letter;Turakainen;Ann. Univ. Turku. Ser. A,1966