PROBABILISTIC MACHINES AND LANGUAGES

REFERENCES

• M.A. Arbib , Realization of stochastic systems , Ann.Math.Stat. , 1967 , vol. 38 , pp. 927 – 933
   Google Scholar
• G.C. Bacon , The decomposition of stochastic automata , Inform. Control , 1964 , vol. 7 , pp. 320 – 339
   Google Scholar
• T.L. Booth , Sequential machines and automata theory New York Wiley 1967
   Google Scholar
• R.G. Buharajev , Criteria for the representation of events in finite probabilistic automata , Dokl. Akad. Nauk SSSR , 1965 , vol. 164 , pp. 289 – 291
   Google Scholar
• J.W. Carlyle , Stochastic finite-state system theory System theory , New York 1969 , pp. 387 – 424
   Google Scholar
• J.W. Carlyle and A. Paz , Realization by stochastic finite automata , J. Com put. Syst. Sci. , 1971 , vol. 5 , pp. 26 – 40
   Google Scholar
• W.J. Chandler , Abstract families of deterministic languages , Proceedings ACM symposium on theory of computing , 1969 , Marina del Rey, Calif , pp. 21 – 30
   Google Scholar
• A.S. Davis , Markov chain as random input automata , Am. Math. Month , 1985 , vol. 68 , pp. 264 – 267
   Google Scholar
• C.A. Ellis , Probabilistic tree automata , Inform. Control , 1970 , vol. 19 , pp. 401 – 406
   Google Scholar
• S. Even , Comments on the minimization of stochastic machines , IKEE Trans , 1965 , vol. 14 , pp. 634 – 637
   Google Scholar
• K.S. Fu , On syntactic pattern recognition and stochastic languages Proceedings of the International Conference on Frontiers of Pattern Recognition , Hawaii 1971
   Google Scholar
• K.S. Fu and T. Huang , Stochastic grammars and languages , Int. J. Compt. Inform. Sci. , 1972 , vol. 1 , pp. 135 – 170
   Google Scholar
• K.S. Fu and T. Li , On stochastic automata and languages , Int. J. Inform. Sci. , 1969 , vol. 1 , pp. 403 – 419
   Web of Science ®Google Scholar
• S.E. Gelenbe , On languages defined by linear probabilistic automata , Inform. Control , 1970 , vol. 16 , pp. 487 – 501
   Google Scholar
• S. Ginsburg and S. Greibach , Abstract families of languages , Am. Malh. Soc. , 1969 , vol. 87 , pp. 41 – 51
   Google Scholar
• U. Grenander , Syntax-controlled probabilities Brown University 1967 , Internal Report, Division of Applied Mathematics ,
   Google Scholar
• T. Hayashi and Y. Inagaki and T. Fukumura , Some notes on stability problems of probabilistic automata , J. Cybern. , 1971 , vol. 1 , pp. 94 – 114
   Google Scholar
• J. Hopcroft and J. Ullman , An approach to a unified theory of automata , Bell Syst. Tech. J. , 1967 , vol. 46 , pp. 1793 – 1829
   Google Scholar
• S.E. Hutchins , Moments of string and derivation lengths of stochastic context-tree grammars , Inform. Sci. , 1972 , vol. 4 , pp. 179 – 191
   Web of Science ®Google Scholar
• M.M. Khcrts , Entropy of languages generated by automata of context-free grammar with a single-valued deducation , Naucho-Tekhn. Inf. Ser. , 1968 , vol. 2 1
   Google Scholar
• R. Knast , Continuous-time probabilistic automata , Inform. Control , 1969 , vol. 15 , p. 335
   Google Scholar
• R. Knast , Finite-state probabilistic languages , Inform. Control , 1972 , vol. 21 , pp. 148 – 170
   Google Scholar
• K. DeLceuw and E.F. Moore and C.E. Shannon and N. Shapiro , Computability by probabilistic machines, automata studies , Ann. Malh. Stud. , 1956 , vol. 34 , pp. 183 – 212
   Google Scholar
• C.L. Liu , A note on definite stochastic sequential machines , Inform. Control , 1969 , vol. 14 , pp. 407 – 421
   Google Scholar
• M. Magidor and G. Moran , Probabilistic tree automata and context-free languages , Israel J. Math. , 1970 , vol. 8 , pp. 340 – 348
   Web of Science ®Google Scholar
• M. Mizumoto and J. Toyoda and K. Tanaka , General formulation of formal grammars , Inform. Sci. , 1973 , vol. 5 , pp. 25 – 43
   Web of Science ®Google Scholar
• M. Nasu and N. lionda , Fuzzy events realized by finite probabilistic automata , Inform. Control , 1968 , vol. 12 , pp. 84 – 303
   Google Scholar
• T.T. Nieh , Stochastic sequential machines with prescribed criteria , Inform. Control , 1968 , vol. 13 , pp. 99 – 113
   Google Scholar
• E.H. Ott , Theory and applications of stochastic sequential machines Sudbury Sperry Rand Research Center 1966 , Report No. SRRC-RR , pp. 66 – 39
   Google Scholar
• C.V. Page , Strong stability problems for probabilistic sequential machines , Inform. Control , 1969 , vol. 15 , p. 487
   Google Scholar
• A. Paz , Some aspects of probabilistic automata , Inform. Control , 1966 , vol. 9 , pp. 26 – 60
   Google Scholar
• A. Paz , Introduction to probabilistic automata New York Academic Press 1971
   Google Scholar
• M.O. Rabin , Probabilistic automata , Inform. Control , 1963 , vol. 6 , pp. 230 – 245
   Google Scholar
• A. Saloinaa , Probabilistic and weighted grammars , Inform. Control , 1969 , vol. 15 , pp. 529 – 544
   Google Scholar
• A. Salomaa , Theory of automata New York Pergamon Press 1969
   Google Scholar
• E.S. Santo , Computability by probabilistic Turing machines , Trans. Am. Math. Soc. , 1971 , vol. 159 , pp. 165 – 184
   Web of Science ®Google Scholar
• E.S. Santos , Probabilistic grammars and automata , Inform. Control , 1972 , vol. 21 , pp. 27 – 47
   Google Scholar
• E.S. Santos , Regular probabilistic languages , Inform. Control , 1973 , vol. 23 , pp. 58 – 70
   Google Scholar
• E.S. Santos , Machines, programs and languages , J. Cybern , 1974 , vol. 4 , pp. 71 – 86
   Google Scholar
• E.S. Santos , Realizations of fuzzy languages by probabilistic max-product, and maximin automata , Inform. Sci. , 1975 , vol. 8 , pp. 39 – 53
   Web of Science ®Google Scholar
• E.S. Santos , Probabilistic pushdown automata , J. Cybern. , 1976 , vol. 6 , pp. 173 – 187
   Google Scholar
• D. Scott , Some definitional suggestions for automata theory , J. Comput. Syst. Sci. , 1967 , vol. 1 , pp. 187 – 212
   Google Scholar
• P.H. Starke , Abstrakte Automaten Berlin VEB Deutscher Verlag der Wissenchaften 1969
   Google Scholar
• P.H. Starke and H. Thiele , On asynchronous stochastic automata , Inform. Control , 1970 , vol. 17 , pp. 265 – 293
   Google Scholar
• G.N. Tscrtsvadzc , Certain properties of stochastic automata and certain methods for synthesizing them , Auto, I Telemek , 1963 , vol. 24 , pp. 341 – 352
   Google Scholar
• P. Turakainen , On probabilistic automata and their generalizations , Ann. Acad. Sci. Fenn. , 1968 , vol. 429 , pp. 1 – 53
   Google Scholar
• P. Turakainen , On multistochastic automata , Inform. Control , 1973 , vol. 23 , pp. 183 – 203
   Google Scholar