×
Bukharaev, R. G.

Probabilistic automata. (English) Zbl 0457.68045

J. Sov. Math. 13, 359-386 (1980).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0457.68045

Cited in 5 Documents

MSC:

68Q45 Formal languages and automata
68-02 Research exposition (monographs, survey articles) pertaining to computer science
68S05 Mathematical linguistics [See also 03B65, 92K20] (MSC1991)
68W99 Algorithms in computer science

Keywords:

stochastic automata; survey; representation of languages; lexicographic functions; homomorphisms; equivalence; structure theory; random media

Citations:

Zbl 0444.68041
Cite Review PDF
Full Text: DOI

References:

[1] G. A. Agasandyan and V. G. Sragovich, ?On the structural synthesis of probabilistic automata,? Izv. Akad. Nauk SSSR, Tekh. Kibern., No. 6, 121?125 (1971).
[2] V. N. Agafonov and Ya. M. Barzdin’, ?On sets related to probabilistic machines,? Z. Math. Log. Grundl. Math.,20, No. 6, 481?498 (1974). · Zbl 0343.02028 · doi:10.1002/malq.19740203102
[3] G. P. Agibalov, ?Recognition of operators realizable in linear autonomous automata,? Izv. Akad. Nauk SSSR, Tekh. Kibern., No. 3, 99?108 (1970).
[4] G. P. Agibalov and Ya. G. Yufat, ?On simple experiments for linear initial automata,? Avtom. Vychisl. Tekh., No. 2, 17?19 (1972).
[5] Yu. A. Al’pin, ?On decompositions produced by probabilistic automata,? in: Probabilistic Automata and Their Applications [in Russian], Zinatne, Riga (1971), pp. 23?26.
[6] Yu. A. Al’pin, ?The condition of stability of probabilistic automata,? in: Probabilistic Methods and Cybernetics, No. 9, Kazan. Univ. (1971), pp. 3?5.
[7] Yu. A. Al’pin and R. G. Bukharaev, ?On a sufficient condition for the nonrepresentability of languages in finite probabilistic automata,? Dokl. Akad. Nauk SSSR,223, No. 4 (1975).
[8] G. L. Areshyan and G. B. Marandzhyan, ?On some questions in the theory of probabilistic automata,? Tr. Vychisl. Tsentra Akad. Nauk Arm. SSR Erevan. Univ., No. 2, 73?81 (1964). · Zbl 0192.08103
[9] Yu. M. Afanas’ev, A. M. Krysanov, and Yu. P. Letunov, ?Sequential decomposition of probabilistic automata,? Avtom. Telemekh., No. 3, 84?88 (1973).
[10] A. S. Barashko and A. M. Bogomolov, ?On experiments and automata with a source of random signals at input,? Avtom. Vychisl. Tekh., No. 3, 6?14 (1969).
[11] Ya. M. Barzdin’, ?On computability on probabilistic machines,? Dokl. Akad. Nauk SSSR,189, No. 4, 699?702 (1969).
[12] O. S. Belokon’, ?Investigation of convergence processes in the simplest systems of probabilistic automata,? Kibernetika, No. 1, 46?50 (1972).
[13] O. S. Belokon’, ?Analysis of the structure of the companion matrix in a system of finite probabilistic automata,? Akad. Nauk Ukr. SSR, Inst. Kibern. Sekts. Mat. Metody Issled. Optimiz. Sistem, Preprint 73-42, Kiev (1973).
[14] A. M. Bogomolov and V. A. Tverdokhlebov, ?On experiments with probabilistic automata,? in: Kibernetika, Donetskoe Otd., Tr. Sem., No. 1, Kiev (1969), pp. 34?40.
[15] R. G. Bukharaev, ?On the imitation of probabilistic distributions,? Uch. Zap. Kazan. Gos. Univ.,123, No. 6, 56?67 (1963).
[16] R. G. Bukharaev, ?On controllable generators of random variables,? Uch. Zap. Kazan. Gos. Univ.,123, No. 6, 68?87 (1963).
[17] R. G. Bukharaev, ?Some equivalences in the theory of probabilistic automata,? Uch. Zap. Kazan. Gos. Univ.,124, No. 2, 45?65 (1964). · Zbl 0149.01303
[18] R. G. Bukharaev, ?A criterion for the representability of events in finite probabilistic automata,? Dokl. Akad. Nauk SSSR,164, No. 2, 289?291 (1965). · Zbl 0151.24901
[19] R. G. Bukharaev, ?Automatic transformation of probabilistic sequences,? Uch. Zap. Kazan. Gos. Univ.,125, No. 6, 24?33 (1966).
[20] R. G. Bukharaev, ?Two corrections to the paper ?Some equivalence in the theory of probabilistic automata,?? Uch. Zap. Kazan. Gos. Univ.,125, No. 6, 110 (1966).
[21] R. G. Bukharaev, ?On the representability of events in probabilistic automata,? Uch. Zap. Kazan. Gos. Univ.,127, No. 3, 7?20 (1967).
[22] R. G. Bukharaev, ?The theory of probabilistic automata,? Kibernetika, No. 2, 6?23 (1968). · Zbl 0177.45605
[23] R. G. Bukharaev, ?On the problem of minimization of the input of a probabilistic automaton generating a homogeneous finite Markov chain,? Uch. Zap. Kazan. Gos. Univ.,129, No. 4, 3?11 (1969).
[24] R. G. Bukharaev, ?Criteria for the representability of events in finite probabilistic automata,? Dokl. Akad. Nauk SSSR,164, No. 2, 289?291 (1965).
[25] R. G. Bukharaev, ?Criteria for the representability of events infinite probabilistic automata,? Kibernetika, No. 1, 8?17 (1969).
[26] R. G. Bukharaev, Probabilistic Automata [in Russian], Kazan State Univ. (1970).
[27] R. G. Bukharaev, ?The abstract theory of probabilistic automata,? in: Probabilistic Automata and Their Applications [in Russian], Zinatne, Riga (1971), pp. 9?22. · Zbl 0226.94047
[28] R. G. Bukharaev, ?Problems of synthesis of probabilistic transformers,? in: Probabilistic Automata and Their Applications [in Russian], Zinatne, Riga (1971), pp. 61?75.
[29] R. G. Bukharaev, ?Automatic synthesis of a controllable generator of random codes,? in: Probabilistic Automata and Their Applications [in Russian], Zinatne, Riga (1971), pp. 97?101.
[30] R. G. Bukharaev, ?Applied aspects of probabilistic automata,? Avtom. Telemekh., No. 9, 76?86 (1972).
[31] R. G. Bukharaev, ?The theory of abstract probabilistic automata,? in: Probl. Kibern., No. 30, Nauka, Moscow (1975), pp. 147?197.
[32] R. G. Bukharaev and R. R. Bukharaev, ?The topological method of reduction of automata,? Izv. Vyssh. Uchebn. Zaved., Mat., No. 5, 31?39 (1974). · Zbl 0226.94047
[33] É. M. Vaisbrod and G. Sh. Rozenshtein, ?On the ?life? time of stochastic automata,? Izv. Akad. Nauk SSSR, Tekh. Kibern., No. 4, 52?59 (1965).
[34] V. Ya. Valakh, ?Optimization of the behavior of finite and stochastic automata in random media,? in: Teor. Optimal’n. Reshenii. Tr. Sem., No. 3, Kiev (1967), pp. 3?29.
[35] V. Ya. Valakh, ?The time of residence of a stochastic automaton in the set of states with minimal penalty,? in: Teor. Avtom. Metody Formal’nogo Sinteza Vychisl. Mashin Sistem. Tr. Sem., No. 7, Kiev (1969), pp. 62?75.
[36] V. Ya. Valakh, ?On the question of an optimal stochastic automaton in a composite medium,? in: Teor. Optimal’n. Reshenii. Tr. Sem., No. 4, Kiev (1969), pp. 53?62.
[37] V. I. Varshavskii and I. P. Vorontsova, ?On the behavior of stochastic automata with variable structure,? Avtom. Telemekh.,24, No. 33, 353?360 (1963).
[38] V. I. Varshavskii and I. P. Vorontsova, ?Stochastic automata with variable structure,? in: Teor. Konechn. Veroyatn. Avtom., Nauka, Moscow (1965), pp. 301?308.
[39] V. I. Varshavskii and I. P. Vorontsova, ?The use of stochastic automata with variable structure for solving some problems of behavior,? in: Samoobuchayushchiesya Avtomt. Sistemy, Nauka, Moscow (1966), pp. 158?164.
[40] V. I. Varshavskii, I. P. Vorontsova, and M. L. Tsetlin, ?Teaching stochastic automata,? in: Biol. Aspekty Kibern., Akad. Nauk SSSR, Moscow (1962), pp. 192?197.
[41] L. N. Vasershtein, ?Markov processes on a countable product of spaces describing systems of automata,? Probl. Peredachi Inf.,5, No. 3, 64?72 (1969).
[42] Probabilistic Automata and Their Applications, Inst. Elektron. Vychisl. Tekh. Akad. Nauk Latv. SSR, Zinatne, Riga (1971).
[43] G. A. Volovnik, ?Construction of matrices of transition probabilities of finite automata with disturbances,? in: Nadezhn. Effektivn. Diskretn. Sistem, Zinatne, Riga (1968), pp. 147?159.
[44] I. P. Vorontsova, ?Algorithms for altering the transition probabilities of stochastic automata,? Probl. Peredachi Inf.,1, No. 3, 122?126 (1965).
[45] N. Z. Gabbasov, ?On the characteristics of events representable by finite probabilistic automata,? Uch. Zap. Kazan. Gos. Univ.,130, No. 3, 18?27 (1970).
[46] G. G. Galustov, G. M. Pozdnyakov, and V. A. Zimovnov, ?Some results on modeling discerning probabilistic automata,? in: Vopr. Tekhn. Diagnostiki, Taganrog (1975), pp. 42?54.
[47] B. R. Geints, ?The stochastic computing machine,? Elektronika, No. 14 (1967).
[48] M. Gessel and Kh. D. Mondrov, ?On the question of processing random sequences by abstract automata,? in: Diskretn. Sistemy, Vol. 4, Zinatne, Riga (1975), pp. 7?12.
[49] A. Kh. Giorgadze, ?A method of constructing transition matrices for an automaton with stochastic stop elements,? Soobshch. Akad. Nauk Gruz. SSR,54, No. 1, 49?52 (1969).
[50] A. Kh. Giorgadze and L. V. Burshtein, ?Stochastic estimates of the decomposition of probabilistic automata,? Izv. Akad. Nauk SSSR, Tekh. Kibern., No. 1, 138?145 (1974).
[51] A. Kh. Giorgadze and T. L. Dzhebashvili, ?On the question of decomposition of probabilistic automata,? Soobshch. Akad. Nauk Gruz. SSR,76, No. 2, 321?323 (1974). · Zbl 0363.68088
[52] A. Kh. Giorgadze and V. P. Zelentsov, ?Formulation of the problem of control of random processes,? in: Metody Predstavleniya Apparaturn. Analiz Sluchainykh Protsessov Polei, Vol. 1, Novosibirsk (1969), pp. 75?78.
[53] A. Kh. Giorgadze and A. G. Safiulina, ?On iterative decomposition of finite probabilistic automata,? Avtom. Telemekh., No. 9, 81?85 (1974). · Zbl 0309.94062
[54] A. Kh. Giorgadze and A. G. Safiulina, ?Methods of decomposition of probabilistic automata,? Avtom. Vychisl. Tekh., No. 5, 1?5 (1974).
[55] A. Kh. Giorgadze and A. G. Safiulina, ?On decomposition of probabilistic automata,? Kibernetika, No. 2, 6?11 (1975). · Zbl 0309.94062
[56] V. S. Gladkii, ?On the inversion of matrices on probabilistic automata,? in: Veroyatn. Avtom. Primen., Zinatne, Riga (1971), pp. 131?141.
[57] G. Glinskii, ?Theoretical informational problems of the theory of reliable automata,? in: Teor. Konechn. Veroyatn. Avtom., Nauka, Moscow (1965), pp. 280?300.
[58] V. B. Golovehenko, ?Self-organization of a collection of probabilistic automata with the two simplest behavioral ?motives,?? Avtom. Telemekh., No. 4, 151?156 (1974).
[59] V. B. Golovehenko, ?On the dynamics of the interacting probabilistic automata of Moore,? in: Avtomatizir. Sistemy Upr. (ASUP) ? Teoriya, Metodol. Modelirov., Tekhn. Sredstva, Irkutsk (1974), pp. 138?143.
[60] V. A. Gorbatov, A. M. Krysanov, and Yu. P. Letunov, ?Parallel decomposition of probabilistic automata,? Izv. Akad. Nauk SSSR, Tekh. Kibern., No. 5, 112?120 (1972).
[61] A. P. Goryashko, ?The ?diffusion? model of the functioning of a probabilistic automaton,? Izv. Akad. Nauk SSSR, Tekh. Kibern., No. 4, 133?136 (1972).
[62] V. B. Grigorenko, A. N. Rapoport, and E. I. Ronin, ?The investigation of learning systems realized in the form of probabilistic automata,? Izv. Vyssh. Uchebn. Zaved., Radiofiz.,14, No. 7, 1026?1034 (1971).
[63] Ya. A. Dubrov, ?On the theory of noninitial probabilistic automata,? in: Teor. Avtom. Metody Formalizovan. Sinteza Vychisl. Mashin Sistem. Tr. Sem., No. 5, Kiev (1969), pp. 33?39.
[64] G. E. Zhuravlev and V. N. Veselov, ?Investigation of a forgetting automaton,? Izv. Akad. Nauk SSSR, Tekh. Kibern., No. 4, 118?126 (1970).
[65] V. P. Zarovnyi, ?On the theory of infinite linear and quasilinear automata,? Kibernetika, No. 4, 5?17 (1971).
[66] Yasuesi Inagava, ?Probabilistic automata,? Suri Kacheku, Math. Sci.,9, No. 8, 39?40, 42?47 (1971).
[67] Yasuesi Inagava, ?Probabilistic automata,? Bull. Electrotech. Lab.,29, No. 6 (1965).
[68] N. P. Kandelaki and G. N. Tsertsvadze, ?On the behavior of certain classes of stochastic automata in random media,? Avtom. Telemekh.,24, No. 6, 115?119 (1966).
[69] N. P. Kandelaki and G. N. Tsertsvadze, ?Solution of the problem of localization of the characteristic numbers of matrices of automata possessing asymptotically optimal behavior in stationary random media,? Tr. Vychisl. Tsentra Akad. Nauk Gruz. SSR,9, No. 1, 144?149 (1969).
[70] A. K. Kel’mans, ?On the coherence of probabilistic schemes,? Avtom. Telemekh., No. 3, 98?116 (1967).
[71] B. F. Kir’yanov, ?Equivalence of systems realizing stochastic principles of computation,? Izv. Akad. Nauk SSSR, Tekh. Kibern., No. 5, 121?128 (1972).
[72] I. N. Kovalenko, ?A remark on the complexity of representing events in probabilistic and deterministic automata,? Kibernetika, No. 2, 35?36 (1965).
[73] G. Ya. Kostromin, ?On finding the impulse vector for a stochastic machine,? Redkollegya Zh. Avtom. Vychisl. Tekh. Akad. Nauk Latv. SSR, Riga (1972).
[74] B. S. Kochkarev, ?On the question of stability of probabilistic automata,? Uch. Zap. Kazan. Gos. Univ.,127, No. 3, 82?87 (1967).
[75] B. S. Kochkarev, ?On the stability of probabilistic automata,? Kibernetika, No. 2, 24?30 (1968).
[76] B. S. Kochkarev, ?On verifying the feasibility of a sufficient condition for the stability of probabilistic automata,? in: Teor. Avtom. Sem., No. 4, Akad. Nauk Ukr. SSR, Kiev (1967), pp. 79?90; also Kibernetika, No. 4 (1969).
[77] B. S. Kochkarev, ?On the partial stability of probabilistic automata,? Dokl. Akad. Nauk SSSR,182, No. 5, 1022?1025 (1968).
[78] B. S. Kochkarev, ?On a sufficient condition for the definiteness of an event represented by a probabilistic automaton,? Uch. Zap. Kazan. Gos. Univ.,129, No. 4, 12?20 (1969).
[79] A. I. Krysanov, ?Algorithms for parallel decomposition of probabilistic automata,? in: Ekon.-Mat. Metody Programmir. Plan. Ekon. Zadach, Moscow (1972), pp. 126?134.
[80] Yu. I. Kuklin, ?Two-sided probabilistic automata,? Avtom. Vychisl. Tekh., No. 5, 35?36 (1973).
[81] A. É. Kéévalik and G. É. Yakobson, ?On a means of decomposing autonomous probabilistic automata,? Tr. Tallin. Politekh. Inst., No. 350, 53?59 (1973).
[82] A. É. Kéévalik and G. É. Yakobson, ?A method of decomposing probabilistic automata,? in: Diskretn. Sistemy, Vol. 4, Zinatne, Riga (1974), pp. 13?21.
[83] V. G. Lazarev and V. M. Chentsov, ?On the question of obtaining a reduced form of a stochastic automaton,? in: Sintez Diskretn. Avtom. Upr. Ustroistv, Nauka, Moscow (1968).
[84] V. G. Lazarev and V. M. Chentsov, ?Use of stochastic automata for distributing information,? in: Avtom., Gibridn. Upr. Mashiny, Nauka, Moscow (1972), pp. 66?72.
[85] V. G. Lazarev and V. M. Chentsov, ?On minimizing the number of internal states of a stochastic automaton,? in: Sintez Diskretn. Avton. Upr. Ustroistv, Nauka, Moscow (1968), pp. 150?159.
[86] Ya. K. Lapin’sh, ?Minimization of probabilistic automata representing finite information media,? Avtom. Vychisl. Tekh., No. 1, 7?9 (1973).
[87] Ya. K. Lapin’sh, ?On nonstochastic languages obtained as the union or intersection of stochastic languages,? Avtom. Vychisl. Tekh., No. 4, 6?13 (1974).
[88] Ya. K. Lapin’sh and I. A. Metra, ?On a method of synthesis of transformers of probability distributions,? Avtom. Vychisl. Tekh., No. 4, 32?37 (1973).
[89] A. A. Larin, ?Basic concepts of the theory of ciphered automata,? in: Kibern. Avtom. Upr., Tr. Sem., No. 2, Kiev (1968), pp. 3?8.
[90] A. A. Larin, ?Basic concepts of the theory of probabilistic ciphered automata,? in: Avtom., Gibridn. Upr. Mashiny, Nauka, Moscow (1972), pp. 59?65.
[91] V. I. Levin, ?Determination of the characteristics of probabilistic automata with reverse channels,? Izv. Akad. Nauk SSSR, Tekh. Kibern., No. 3, 107?110 (1966).
[92] V. I. Levin, ?An operational method of studying probabilistic automata,? Avtom. Vychisl. Tekh., No. 1, 18?25 (1967).
[93] V. I. Levin, ?Multichannel probabilistic automata,? Izv. Akad. Nauk SSSR, Tekh. Kibern., No. 6, 63?68 (1968).
[94] V. I. Levin, ?Analysis of the reliability of inhomogeneous Markov automata,? in: Nadezhn. Effektivn. Diskretn. Sistem, Zinatne, Riga (1968), pp. 141?145.
[95] K. de Leeuw, E. F. Moore, K. E. Shannon, and N. Shapiro, ?Computability on probabilistic machines,? in: Avtomaty [Russian translation], IL, Moscow (1956), pp. 281?305.
[96] A. A. Lorents, ?Some questions in the constructive theory of finite probabilistic automata,? Avtom. Vychisl. Tekh., No. 5, 57?80 (1967).
[97] A. A. Lorents, ?Generalized quasidefinite finite probabilistic automata and some algorithmic problems,? Avtom. Vychisl. Tekh., No. 5, 1?8 (1968).
[98] A. A. Lorents, ?Questions of reducibility of finite probabilistic automata,? Avtom. Vychisl. Tekh., No. 7, 4?13 (1969).
[99] A. A. Lorents, ?Synthesis of stable probabilistic automata,? Avtom. Vychisl. Tekh., No. 4, 90?91 (1969).
[100] A. A. Lorents, ?Economy of states of finite probabilistic automata,? Avtom. Vychisl. Tekh., No. 2, 1?9 (1969).
[101] A. A. Lorents, ?On the character of events representable in finite probabilistic automata,? Avtom. Vychisl. Tekh., No. 3, 91?93 (1971). · Zbl 0221.94082
[102] A. A. Lorents, Elements of the Constructive Theory of Probabilistic Automata [in Russian], Zinatne, Riga (1972). · Zbl 0227.94037
[103] A. A. Lorents, ?Problems in the constructive theory of probabilistic automata,? in: Veroyatn. Avtom. Primen., Zinatne, Riga (1971), pp. 37?53.
[104] A. A. Lorents, Synthesis of Reliable Probabilistic Automata [in Russian], Zinatne, Riga (1975).
[105] A. A. Lorents, ?On the stability of finite probabilistic automata,? in: Teor. Konechn. Avtom. Ee Prilozhen., No. 3, Zinatne, Riga (1974), pp. 52?60.
[106] L. V. Makarevich, ?On attainability in probabilistic automata,? Soobshch. Akad. Nauk Gruz. SSR,53, No. 2, 293?296 (1969).
[107] A. A. Lorents, ?On the realizability of probability operators in logical networks,? in: Diskretn. Analiz, No. 15, Novosibirsk (1969), pp. 35?36.
[108] A. A. Lorents, ?The problem of completeness in the structure theory of probabilistic automata,? Kibernetika, No. 1, 17?30 (1971).
[109] A. A. Lorents, ?On the general approach to the structure theory of probabilistic automata,? in: Veroyatn. Avtom. Primen., Zinatne, Riga (1971).
[110] A. A. Lorents and A. Kh. Giorgadze, ?On the question of the structure theory of probabilistic automata,? Soobshch. Akad. Nauk Gruz. SSR,50, No. 1, 37?42 (1968).
[111] A. A. Lorents and A. A. Matevosyan, ?The transformation of random sequences in automata,? Avtom. Vychisl. Tekh., No. 5, 8?13 (1970).
[112] A. A. Lorents and A. A. Matevosyan, ?Adjustable experiments with finite probabilistic automata,? Avtom. Telemekh., No. 8, 88?92 (1972).
[113] A. A. Lorents and A. A. Matevosyan, ?Ergodic automata,? Soobshch. Akad. Nauk Gruz. SSR,78, No. 2, 313?315 (1975).
[114] S. V. Makarov, ?On the realization of stochastic matrices by finite automata,? in: Vychisl. Sistemy, No. 9, Novosibirsk (1963), pp. 65?70.
[115] G. B. Marandzhyan, ?On distinguishing the most probable trajectories of Markov chains,? Sb. Nauchn. Tr. Erevan. Politekh. Inst.,24, 231?238 (1968).
[116] A. N. Maslov, ?Probabilistic Turing machines and recursive functions,? Dokl. Akad. Nauk SSSR,205, No. 5, 1018?1020 (1972). · Zbl 0268.02027
[117] A. A. Matevosyan, ?On the universal source of P-ary random sequences,? Inst. Kibern. Akad. Nauk Gruz. SSR, Tbilisi (1974).
[118] L. P. Matyushkov, ?On the realization of autonomous stochastic automata,? Tr. I Resp. Konferentsii Matematikov Belorussii, 1964, Vysshaya Shkola, Minsk (1965), pp. 166?170.
[119] Boyan Metev, ?Some probabilistic automata with variable structure,? Tr. Mezhdunar. Sem. Prikl. Aspektam Teor. Avtom., Vol. 2, Varna (1971), pp. 442?449.
[120] I. A. Metra, ?Comparison of the number of states of probabilistic and deterministic automata representing given events,? Avtom. Vychisl. Tekh., No. 5, 94?96 (1971).
[121] I. A. Metra, ?A stochastic calculator,? in: Veroyatn. Avtom. Primen., Zinatne, Riga (1971), pp. 33?36.
[122] I. A. Metra, ?On the enlargement of products of stochastic matrices,? Avtom. Vychisl. Tekh., No. 3, 20 (1972).
[123] I. A. Metra and A. A. Smilgais, ?On the definiteness and regularity of events represented by probabilistic automata,? Avtom. Vychisl. Tekh., No. 4, 1?7 (1968).
[124] I. A. Metra and A. A. Smilgais, ?On some possibilities of representing nonregular events by probabilistic automata,? Latv. Mat. Ezhegodnik, No. 3, Zinatne, Riga (1968), pp. 253?261.
[125] A. A. Muchnik, ?General linear automata,? Probl. Kibern., No. 23, 171?208 (1970).
[126] A. A. Muchnik and A. N. Maslov, ?Regular, linear, and probabilistic events,? Tr. Mat. Inst. Akad. Nauk SSSR,133, 149?168 (1973).
[127] M. B. Nevel’son and R. Z. Khas’minskii, ?On the stability of stochastic systems,? Probl. Peredachi Inf.,2, No. 3, 76?91 (1966).
[128] Yu. I. Neimark, V. P. Grigorenko, and A. N. Rapoport, ?On optimization by independent deterministic and stochastic automata,? in: Prikl. Mat. Kibernet. Mater. Vses. Mezhvuz. Simp. Prikl. Mat. Kibernt., Gorkii (1967), pp. 148?166.
[129] N. Ya. Parshenkov and V. M. Chentsov, ?On the question of minimization of a stochastic automaton,? Probl. Peredachi Inf.,5, No. 4, 81?83 (1969).
[130] N. Ya. Parshenkov and V. M. Chentsov, ?The stability of internal states of a probabilistic automaton,? Kibernetika, No. 6, 47?52 (1970).
[131] N. Ya. Parshenkov and V. M. Chentsov, ?On the theory of stochastic automata,? in: Diskretn. Avtom. Seti Svyazi, Nauka, Moscow (1970, pp. 141?184.
[132] N. Ya. Parshenkov and V. M. Chentsov, ?Some questions in the theory of probabilistic automata,? Tr. Mezhdunar. Simp. Prikl. Aspektam Teor. Avtom., Vol. 2, Varna (1971), pp. 454?463.
[133] N. Ya. Parshenkov and V. M. Chentsov, ?Questions in the theory of probabilistic automata,? in: Avtom. Upr. Setyami Svyazi, Nauka, Moscow (1971), pp. 180?202.
[134] K. M. Podnik, ?On profile points of some probabilistic automata,? Avtom. Vychisl. Tekh., No. 5, 90?91 (1970).
[135] A. S. Pozdnyak, ?Adaptive probabilistic automata,? in: VI Vses. Soveshch. po Probl. Upr., 1974, Ref. Dokl. Ch. I., Nauka, Moscow (1974), pp. 57?61.
[136] A. S. Pozdnyak, ?Investigation of the convergence of algorithms of self-teaching stochastic automata,? Avtom. Telemekh., No. 1, 88?103 (1975).
[137] D. A. Pospelov, ?On some problems of probabilistic logic,? Tr. Mosk. Energ. Inst., No. 42, 153?159 (1962).
[138] D. A. Pospelov, Probabilistic Automata [in Russian], Énergiya, Moscow (1970).
[139] Val. P. Pyatkin, Vyach. P. Pyatkin, and A. K. Romanov, ?On a problem of synthesis of probabilistic automata,? Izv. Akad. Nauk SSSR, Tekh. Kibern., No. 4, 130?132 (1972).
[140] L. A. Rastrigin and K. K. Ripa, ?Statistical search as a probabilistic automaton,? Avtom. Vychisl. Tekh., No. 1, 50?55 (1971).
[141] K. K. Ripa, ?Some stochastic properties of optimizing automata and random search,? Avtom. Vychisl. Tekh., No. 3, 28?32 (1970). · Zbl 0209.22701
[142] K. K. Ripa, ?Properties of a system of optimization by a collection of independent automata with random outputs,? in: Probl. Sluchain. Poiska, No. 3, Zinatne, Riga (1974), pp. 27?41.
[143] K. K. Ripa, ?Algorithms of self-instruction in random search as probabilistic automata,? in: Probl. Sluchain. Poiska, No. 2, Zinatne, Riga (1973), pp. 99?126.
[144] V. N. Roginskii, ?On a type of probabilistic discrete automata,? Probl. Peredachi Inf., No. 17, 85?90 (1964).
[145] A. R. Rotenberg, ?Asymptotic enlargement of states of some stochastic automata,? Probl. Peredachi Inf.,9, No. 4 (1974).
[146] L. L. Rotkop, ?Methods of investigating statistical automata of relay action under stochastic perturbations,? Izv. Akad. Nauk SSSR, Tekh. Kibern., No. 4, 107?114 (1963).
[147] I. V. Safonov, ?On the question of determining transition probabilities,? in: Teor. Avtom. Tr. Sem., No. 1, Kiev (1969), pp. 107?112.
[148] É. M. Sil’vestrova, ?Finite Markov stochastic automata with discrete time, I,? Kibernetika, No. 3, 122?133 (1972).
[149] É. M. Sil’vestrova, ?Finite Markov stochastic automata with discrete time. II,? Kibernetika, No. 4, 26?30 (1972).
[150] É. M. Sil’vestrova, ?On the optimal construction of probabilistic automata with alternative memory,? in: Mat. Modeli Slozhn. Sistem, Kiev (1973), pp. 169?173.
[151] V. G. Sragovich and Yu. A. Flerov, ?On a class of stochastic automata,? Izv. Akad. Nauk SSSR, Tekh. Kibern., No. 2, 66?73 (1965).
[152] R. L. Skhirtladze, ?On the synthesis of P-schemes from contacts with random discrete states,? Soobshch. Akad. Nauk Gruz. SSSR,26, No. 2, 181?186 (1961).
[153] R. L. Skhirtladze, ?Equalization of distributions of double random sequences by functions of the logic algebra,? Soobshch. Akad. Nauk Gruz. SSR,37, No. 1, 37?44 (1965).
[154] R. L. Skhirtladze, ?On the optimal equalization of distributions of Boolean random quantities,? Soobshch. Akad. Nauk Gruz. SSR,40, No. 3, 559?566 (1965).
[155] R. L. Skhirtladze, ?On a method of constructing Boolean quantities with a given probability distribution,? in: Diskretn. Analiz, No. 7, Novosibirsk (1966), pp. 71?80.
[156] R. L. Skhirtladze, ?On a method of synthesis of a Markov automaton,? Soobshch. Akad. Nauk Gruz. SSR,55, No. 3, 549?552 (1969).
[157] R. L. Skhirtladze, ?Synthesis of probabilistic transformers in a code of ?diagonal? vectors,? in: Issled. Nekotor. Vopr. Mat. Kibernt., Tbilisi Gos. Univ., Tbilisi (1973), pp. 81?86.
[158] R. L. Skhirtladze and V. V. Chavchanidze, ?On the question of synthesis of discrete stochastic devices,? Soobshch. Akad. Nauk Gruz. SSR,27, No. 5 (1961).
[159] Theory of Finite and Probabilistic Automata, Tr. Mezhdunar. Simposiuma po Teorii Relein. Ustroistv Konechn. Avtomatov (IFAK), Nauka, Moscow (1965), p. 403.
[160] B. A. Trakhtenbrot, ?Remarks on the complexity of computations on probabilistic machines,? in: Teor. Algoritmov Mat. Logiki, Vychisl. Tsentr Akad. Nauk SSSR, Moscow (1974), pp. 159?176.
[161] E. S. Usachev, ?A stochastic model of instruction and its properties,? in: Issled. po Teorii Samonastraivayushch. Sistem, Vychisl. Tsentr Akad. Nauk SSSR, Moscow (1967), pp. 8?26.
[162] E. S. Usachev, ?On the realization of a stochastic model of an automaton,? in: Issled. po Teorii Samonastraivayushch. Sistem, Vychisl. Tsentr Akad. Nauk SSSR, Moscow (1971), pp. 207?222.
[163] T. Farago, ?On a formulation of the prediction problem by means of a probabilistic automaton,? in: Vychisl. Tekh. Vopr. Kibern., No. 10, Leningrad. Univ. (1974), pp. 46?61.
[164] Yu. A. Flerov, ?On results of stochastic automata,? in: Issled. po Teorii Samonastraivayuslich. Sistem, Vychisl. Tsentr Akad. Nauk SSSR, Moscow (1967), pp. 97?114.
[165] Yu. A. Flerov, ?The limiting behavior of a class of stochastic automata with variable structure,? in: Vopr. Kibern., Adaptiv. Sistemy, Moscow (1974), pp. 140?145.
[166] R. V. Freivald, ?On comparison of the possibilities of probabilistic and frequency algorithms,? in: Diskretn. Sistemy, Vol. 4, Zinatne, Riga (1974), pp. 280?287.
[167] Fudzimato Sinti and Fukao Takesi, ?Analysis of a probabilistic automaton,? Byull. Elektr. Tekh. Lab.,30, No. 8 (1966).
[168] G. N. Tsertsvadze, ?Some properties and methods of synthesis of stochastic automata,? Avtom. Telemekh.,24, No. 3, 341?352 (1963).
[169] G. N. Tsertsvadze, ?Stochastic automata and the problem of constructing reliable automata and their unreliable elements,? Avtom. Telemekh.,25, No. 2, 213?226 (1964).
[170] G. N. Tsertsvadze, ?On stochastic automata asymptotically optimal in a random medium,? Soobshch. Akad. Nauk Gruz. SSR,43, No. 2, 433?438 (1966).
[171] G. N. Tsertsvadze, ?A stochastic automaton with a hysteresis tactic,? Tbilisi Univ. Shromebi, Tr. Tbilisi Univ.,135, 57?61 (1970).
[172] M. L. Tsetlin and S. L. Ginzburg, ?On a construction of stochastic automata,? Probl. Kibern., No. 20, 19?26 (1968).
[173] V. M. Chentsov, ?Synthesis of a stochastic automaton,? in: Probl. Sinteza Tsifrovykh Avtomatov, No. 13, Nauka, Moscow (1967), pp. 135?144.
[174] V. M. Chentsov, ?On a method of synthesis of an autonomous stochastic automaton,? Kibernetika, No. 3, 32?35 (1968).
[175] V. M. Chentsov, ?Synthesis of a stochastic automaton,? in: Probl. Sinteza Tsifrovykh Avtomatov, Nauka, Moscow (1967), pp. 135?144.
[176] V. M. Chentsov, ?Investigation of the behavior or stochastic automata with variable structure,? in: Inf. Seti Kommutatsiya, Nauka, Moscow (1968).
[177] V. N. Chetverikov, E. A. Bakanovich, and A. V. Men’kov, ?Investigations of controllable probabilistic elements and devices,? in: Diskretn. Sistemy, Vol. 4, Zinatne, Riga (1974), pp. 57?66.
[178] M. K. Chirkov, ?On the analysis of probabilistic automata,? in: Vychisl. Tekh. Vopr. Programmir., No. 4, Leningrad State Univ. (1965), pp. 100?103.
[179] M. K. Chirkov, ?Composition of probabilistic automata,? in: Vychisl. Tekh. Vopr. Kibern., No. 5, Leningrad State Univ. (1968), pp. 31?59.
[180] M. K. Chirkov, ?Probabilistic automata and probabilistic mappings,? in: Diskretn. Analiz, No. 7, Novosibirsk (1966), pp. 61?70.
[181] M. K. Chirkov, ?Equivalence of probabilistic finite automata,? in: Vychisl. Tekh. Vopr. Kibern., No. 5, Leningrad State Univ. (1968), pp. 3?30.
[182] M. K. Chirkov, ?On probabilistic finite automata,? in: Vychisl. Tekh. Vopr. Programmir. No. 3, Leningrad State Univ. (1964), pp. 44?57.
[183] M. K. Chirkov, ?Probabilistic problems of completely defining partial automata without memory,? in: Vychisl. Tekh. Vopr. Kibern., No. 8, Leningrad State Univ. (1971), pp. 66?81.
[184] M. K. Chirkov, ?On minimization of probabilistic automata,? in: Vychisl. Tekh. Vopr. Kibern., No. 9, Mosk. Gos. Univ., Moscow (1972), pp. 88?99.
[185] M. K. Chirkov and Bui-Min Chi, ?Reduced forms of partial probabilistic automata,? in: Vychisl. Tekh. Vopr. Kibern., No. 11, Mosk. Gos. Univ., Moscow, pp. 80?93.
[186] M. K. Chirkov and T. P. Shitkevich, ?On the realizability of probabilistic automata by automata with random inputs,? in: Metody Vychisl., No. 6, Leningrad State Univ. (1970), pp. 127?136.
[187] Yu. I. Shmukler, ?Theoretical informational estimates of the instruction process,? in: Tekh. Kibern., Nauka, Moscow (1965), pp. 318?325.
[188] Yu. I. Shmukler, ?On the search for a conditional extremum by a probabilistic automaton,? in: Issled. po Teorii Samonastraivayushch. Sistem, Vychisl. Tsentr Akad. Nauk SSSR, Moscow (1967), pp. 115?137.
[189] Yu. A. Shreider, ?Instruction models and control systems,? in: Bush and Mosteller, Stochastic Models of Instructability [Russian translation], IL, Moscow (1962).
[190] V. V. Yakovlev, ?Stochastic functional transformers,? Avtom. Vychisl. Tekh., No. 6, 25?28 (1973).
[191] N. V. Yarovitskii, ?Limiting behavior of a closed system of automata with random input,? Kibernetika, No. 1, 57?61 (1965).
[192] N. V. Yarovitskii, ?Probabilistic autonomous modeling of discrete systems,? Kibernetika, No. 5, 35?43 (1966).
[193] N. V. Yarovitskii, ?An existence theorem for ergodic distributions for a particular system of automata,? in: Teor. Avtomatov, Sem., No. 1, Naukova Dumka, Kiev (1966), pp. 22?23.
[194] A. Adam, ?On stochastic truth functions,? Coloq. Inf. Theory, Debrecen (1967), Abstracts, Budapest, pp. 1?2.
[195] G. Adomian, ?Linear stochastic operators,? Rev. Mod. Phys.,35, No. 1, 185?207 (1963). · Zbl 0114.08503 · doi:10.1103/RevModPhys.35.185
[196] Tihomir Z. Aleksic, ?On near optimal decomposition of stochastic matrices,? Publ. Elektrotekh. Fak. Univ. Beogradu, Ser. Math. Fiz., No. 274-301, 135?138 (1969).
[197] M. Arbib, ?Realization of stochastic systems,? Ann. Math. Statist.,38, No. 3, 927?933 (1967). · Zbl 0147.36801 · doi:10.1214/aoms/1177698889
[198] Baba Norio and Sawaragi Yoshikazu, ?Consideration on the learning behaviors of stochastic automata,? Trans. Soc. Instrum. Control Eng.,10, No. 1, 78?85 (1974). · Zbl 0276.94021 · doi:10.9746/sicetr1965.10.78
[199] G. C. Bacon, ?The decomposition of stochastic automata,? Inf. Control,7, No. 3, 320?339 (1964). · Zbl 0134.24702 · doi:10.1016/S0019-9958(64)90374-2
[200] G. C. Bacon, ?Minimal-state stochastic finite-state systems,? IEEE Trans. Circuit Theory,CT-11(1964).
[201] F. Bancilhon, ?A geometric model for stochastic automata,? IEEE Trans. Comput.,23, No. 12, 1290?1299 (1974). · Zbl 0299.94047 · doi:10.1109/T-C.1974.223848
[202] R. Baztoszynski, ?Some remarks on extension of stochastic automata,? Bull. Acad. Pol. Sci. Ser., Sci. Math., Astron., Phys.,18, No. 9, 551?556 (1970).
[203] A. T. Bertoni, ?The solution of problems relative to probabilistic automata in the frame of the formal language theory,? Lect. Notes Comput. Sci.,26, 107?112 (1975). · Zbl 0327.94069
[204] A. T. Bertoni, ?Mathematical methods of the theory of stochastic automata,? Lect. Notes Comput. Sci.,28, 9?22 (1975). · Zbl 0327.94068 · doi:10.1007/3-540-07162-8_662
[205] D. Blackwell and L. Koopmans, ?On the identifiability problem for functions of finite Markov states,? Ann. Math. Statist.,28, No. 4, 1011?1015 (1957). · Zbl 0080.34901 · doi:10.1214/aoms/1177706802
[206] Taylor L. Booth, ?Probabilistic automata and system models. An overview,? Fifth Asilomar Conf. Circuits and Syst., Pacific Grove Calif. (1971); Conf. Rec., North Hollywood, Calif. (1972), pp. 1?4.
[207] K. H. Böhling and G. Dittrich, ?Endliche stochastische Automaten, Vol. 1, Hochschulskripten, No. 6, 766a, Bibliographisches Institut, Mannheim-Vienna-Zurich (1972). · Zbl 0232.94031
[208] J. F. Böhme, ?Einfache diagnostische Vorgabeexperimente mit stochastischen Automaten,? Ber. Math. Forschungsinst., Oberwolfach, No. 3, 117?127 (1970). · Zbl 0209.31206
[209] J. F. Böhme, ?Diagnostische Vorgabeexperimente mit stochastischen Automaten,? Computing,8, No. 2, 2 (1971). · Zbl 0225.94049 · doi:10.1007/BF02234045
[210] J. F. Böhme, ?Experimente mit stochastischen Automaten,? Diss. Doct., Ing. Tech. Fak. Univ. Erlangen-Nürnberg (1970).
[211] R. G. Bukharaev (Bukharajev), ?Applied aspects of probabilistic automata,? Prog. IFAC 5-th World Congr., Part 4, S. 1, s.a. 39-2/1?39-12/8 (1972).
[212] J. W. Carlyle, ?Reduced forms for stochastic sequential machines,? J. Math. Anal. Appl.,7, No. 2, 167?175 (1963). · Zbl 0281.94038 · doi:10.1016/0022-247X(63)90045-3
[213] J. W. Carlyle, ?On the external probability structure of finite-state channels,? Inf. Control,7, No. 3, 385?397 (1964). · Zbl 0156.40604 · doi:10.1016/S0019-9958(64)90470-X
[214] J. W. Carlyle, ?State-calculable stochastic sequential machines, equivalences, and events,? IEEE Conf. Rec. Switch. Circuit Theory and Logic Design, Ann Arbor, Mich. (1965); Inst. Electron. Eng. Inc., New York (1965), pp. 258?263.
[215] J. W. Carlyle, ?Stochastic finite-state system theory,? in: System Theory, McGraw-Hill, No. 4 (1969), pp. 387?424.
[216] J. W. Carlyle and A. Paz, ?Realizations by stochastic finite automata,? J. Comput. Syst. Sci.,5, No. 1, 26?40 (1971). · Zbl 0236.94042 · doi:10.1016/S0022-0000(71)80005-3
[217] J. Cerny, ?Note on stochastic transformers,? Mat. Cas.,20, No. 2, 101?108 (1970).
[218] J. Cerny and J. Vinaz, ?On simple stochastic models,? Mat. Cas.,20, No. 4, 293?303 (1970).
[219] B. Chandrasekaran and D. W. Shen, ?Adaptation of stochastic automata in nonstationary environments,? Proc. Nat. Electron. Conf., Chicago, Ill. 1967, Vol. 23, Chicago, Ill. (1967), pp. 39?44.
[220] B. Chandrasekaran and D. W. Shen, ?Stochastic automata games,? IEEE Trans. Syst. Sci. Cybern.,5, No. 2, 145?149 (1969). · Zbl 0211.02203 · doi:10.1109/TSSC.1969.300206
[221] Chen Chi-Tsong, ?Minimization of linear sequential machines,? IEEE Trans. Comput.,23, No. 1, 93?95 (1974). · Zbl 0274.94050 · doi:10.1109/T-C.1974.223785
[222] Chen I-Ngo and C. L. Sheng, ?The decision problems of definite stochastic automata,? SIAM J. Control,8, No. 1, 124?134 (1970). · Zbl 0195.02702 · doi:10.1137/0308008
[223] V. Claus, ?Ein Reduktionssatz für stochastische Automaten,? Z. Angew Math. Mech.,48, No. 8, Sonderh., 115?117 (1968). · Zbl 0184.28801
[224] J. P. Cleave, ?The synthesis of finite homogeneous Markov chains,? Cybernetica,115 (1962). · Zbl 0142.14501
[225] A. S. Davis, ?Markov chains as random input automata,? Am. Math. Monthly,68, No. 3, 264?267 (1961). · Zbl 0135.19104 · doi:10.2307/2311462
[226] K. Ecker and H. Ratschek, ?Eigenschaften der von linearen Automaten erkennbaren Worte,? Acta Inf.,3, No. 4, 365?383 (1974). · Zbl 0272.94027 · doi:10.1007/BF00263590
[227] L. Eichner, ?Homomorphe Darstellung endlicher Automaten in linearen Automaten,? Elektron. Inf. Kybern.,9, No. 10, 587?613 (1973). · Zbl 0283.94016
[228] H. N. El-Choroury and S. C. Gupta, ?Convex stochastic sequential machines,? Int. J. Sci. Syst.,2, No. 1, 97?112 (1971). · Zbl 0228.94037 · doi:10.1080/00207727108920180
[229] H. N. El-Choroury and S. C. Gupta, ?Realization of stochastic automata,? IEEE Trans. Comput.,20, No. 8, 889?893 (1971). · Zbl 0224.94065 · doi:10.1109/T-C.1971.223366
[230] C. A. Ellis, ?Probabilistic languages and automata,? PhD Diss. Univ. Ill. (1969).
[231] C. A. Ellis, ?Probabilistic tree automata,? Inf. Control,19, No. 5, 401?416 (1971). · Zbl 0228.94038 · doi:10.1016/S0019-9958(71)90673-5
[232] H. J. Engelbert, ?Zur Reduktion stochastischer Automaten,? Elektron. Inf. Kybernk.,4, No. 2, 81?92 (1968). · Zbl 0169.31602
[233] S. Even, ?Comments on the minimization of stochastic machines,? IEEE Trans. Electron. Comput.,14, No. 4, 634?637 (1965). · Zbl 0146.24801 · doi:10.1109/PGEC.1965.264008
[234] G. Feichtinger, ?Zur Theorie abstrakter stochastischen Automaten,? Z. Wahrscheinlichkeitstheorie Verw. Geb.,9, No. 4, 341?356 (1968). · Zbl 0165.02501 · doi:10.1007/BF00531757
[235] G. Feichtinger, ?Stochastische Automaten als Grundlage linearen Lernmodelle,? Statistisches Heft,10, No. 1 (1969). · Zbl 0181.31104
[236] G. Feichtinger, ?Ein Markoffsches Lernmodell für Zwei-Personen-Spiele,? Elektron. Datenverarb.,11, No. 7, 322?325 (1969). · Zbl 0174.51902
[237] G. Feichtinger, ?Lernprozesse in stochastischen Automaten,? Lect. Notes Oper. Res. Math. Syst.,24, 66 (1970). · Zbl 0193.48601
[238] G. Feichtinger, ?Gekoppelte stochastische Automaten und sequentielle Zwei-Personen-Spiele,? Unternehmenforsch.,14, No. 4, 249?258. · Zbl 0212.51503
[239] G. Feichtinger, ?Stochastische Automaten mit stetigem Zeitparameter,? Angew. Inf.,13, No. 4, 156?164 (1971). · Zbl 0224.94066
[240] K. Fischer, R. Lindner, and H. Thiele, ?Stabile stochastische Automaten,?3, No. 4, 201?213 (1967).
[241] M. Fox, ?Conditions under which a given process is a function of a Markov chain,? Ann. Math. Statist.,33, No. 3 (1962).
[242] R. V. Freivald, ?Functions computable in the limit by probabilistic machines,? Lect. Notes Comput. Sci.,28, 77?87 (1975). · Zbl 0309.94063 · doi:10.1007/3-540-07162-8_671
[243] S. Fujimoto, ?On the partition pair and the decomposition by partition pair for stochastic automata,? Trans. Inst. Electron. Commun. Eng., Jpn.,56, No. 11, 615?622 (1973).
[244] Fu King-Sun and T. J. Li, ?On stochastic automata and languages,? Inf. Sci.,1, No. 4, 403?419 (1969). · doi:10.1016/0020-0255(69)90024-3
[245] B. R. Gaines, ?Memory minimization in control with stochastic automata,? Electron. Lett.,7, No. 24, 710?711 (1971). · doi:10.1049/el:19710487
[246] H. Gallaire, ?On the isomorphism of linear automata,? Int. Comput. Symp., Venice, Proc., No. 1, 473?484 (1972).
[247] S. E. Gelenbe, ?On the loop-free decomposition of stochastic finite state systems,? Inf. Control,10, No. 5, 474?484 (1970). · Zbl 0225.94048 · doi:10.1016/S0019-9958(70)90389-X
[248] S. E. Gelenbe, ?On probabilistic automata with structural restrictions,? IEEE Conf. Rec. 10th Ann. Sympos. Switch and Automata Theory, Waterloo, 1969, New York (1969), pp. 90?99.
[249] S. E. Gelenbe, ?A realizable model for stochastic sequential machines,? IEEE Trans. Comput.,20, No. 2, 199?204. · Zbl 0225.94047
[250] S. E. Gelenbe, ?On languages defined by probabilistic automata,? Inf. Control,16, No. 5, 487?501 (1970). · Zbl 0245.94045 · doi:10.1016/S0019-9958(70)90254-8
[251] E. J. Gilbert, ?On the identifiability problem for functions of finite Markov chains,? Am. Math. Statist.,30 (1959). · Zbl 0089.34503
[252] A. Gill, ?On a weight distribution problem with applications to the design of a statistic generator,? J. Assoc. Comput. Mach.,10, No. 1, 110?121 (1963). · Zbl 0143.20902 · doi:10.1145/321150.321159
[253] A. Gill, ?The reduced form of a linear automaton,? in: Automata Theory, Academic Press, New York-London (1966), pp. 164?175.
[254] A. Gill, ?Synthesis of probability transformers,? J. Franklin Inst.,274, No. 1, 1?19 (1962). · Zbl 0147.17501 · doi:10.1016/0016-0032(62)90894-3
[255] A. Gill, ?Analysis and synthesis of stable linear sequential circuits,? J. Assoc. Comput. Mach.,12, No. 1, 141?149 (1965). · Zbl 0253.94028 · doi:10.1145/321250.321263
[256] J. T. Gill, ?Computational complexity of probabilistic Turing machines,? Proc. 6th Ann. ACM Symp. on Theory of Comp. (1974), pp. 91?96. · Zbl 0366.02024
[257] R. M. Glorioso, ?Learning in stochastic automata,? 5th Asilomer Conf. Circuits and Syst., Pacific Grove, Calif. (1971); Conf. Rec., North Hollywood, Calif. (1972), pp. 11?15.
[258] A. Goscinski and R. Jakubowski, ?Automat stochastyczny jako model programowania dynamicznego,? Podst. Sterow,2, No. 2, 147?162 (1972).
[259] T. V. Griffiths, ?The unsolvability of the equivalence problem for free nondeterministic generalized machines,? J. Assoc. Comput. Math.,15, No. 3, 409?413 (1968). · Zbl 0162.02302 · doi:10.1145/321466.321473
[260] S. Guiasu, ?On codification in abstract random automata,? Inf. Control,13, No. 4, 277?283 (1968). · Zbl 0162.02702
[261] T. Havranek, ?An application of logical probabilistic expressions to the realization of stochastic automata,? Kybernetika,10, No. 3, 241?257 (1974). · Zbl 0283.94020
[262] A. Heller, ?Probabilistic automata and stochastic transformations,? Math. Syst. Theor.,1, No. 3, 197?208 (1967). · Zbl 0189.01401 · doi:10.1007/BF01703818
[263] H. H. Homuth, ?A type of a stochastic automaton applicable to the communication channel,? Angew. Inf., No. 8, 362?372 (1971).
[264] W. J. Horvath, ?Stochastic models of behavior,? Manag. Sci.,12, No. 12, B513-B518 (1966). · doi:10.1287/mnsc.12.12.B513
[265] Y. Inagaki, T. Fukumura, and H. Matuura, ?Some aspects of linear space automata,? Inf. Control,20, No. 5, 439?479 (1972). · Zbl 0239.94065 · doi:10.1016/S0019-9958(72)90865-0
[266] R. A. Jarvis, ?Adaptive global search in time-variant environment using a probabilistic automaton with pattern recognition supervision,? IEEE Trans. Syst. Sci. Cybern.,6, No. 3, 209?217 (1970). · doi:10.1109/TSSC.1970.300343
[267] R. L. Kashyap, ?Optimization of stochastic finite-state systems,? IEEE Trans., Autom. Control,11, No. 4, 685?692 (1966). · doi:10.1109/TAC.1966.1098458
[268] D. I. Kfoury, ?Synchronizing sequence for probabilistic automata,? Stud. Appl. Math.,49, No. 1, 101?103 (1970). · Zbl 0193.33401 · doi:10.1002/sapm1970491101
[269] D. I. Kfoury and Chung L. Liu, ?Definite stochastic sequential machines and definite stochastic matrices,? IEEE Conf. Rec. 10th Ann. Sympos. Switch and Automata Theory, Waterloo (1969), pp. 100?105.
[270] R. Knast, ?On a certain possibility of structural synthesis of probabilistic automata,? Place Komisji Budowy Maszyn i Elektrotechniki (Posnanskie Towarz. Przyjaciol Nauk),1, No. 5, 57?67 (1967).
[271] R. Knast, ?Representability of nonregular languages in finite probabilistic automata,? Inf. Control,16, No. 3, 285?302 (1970). · Zbl 0196.01903 · doi:10.1016/S0019-9958(70)90149-X
[272] R. Knast, ?Continuous-time probabilistic automata,? Inf. Control,15, No. 4, 335?352 (1969). · Zbl 0188.03402 · doi:10.1016/S0019-9958(69)90468-9
[273] R. Knast, ?Linear probabilistic sequential machines,? Inf. Control,15, No. 2, 111?129 (1969). · Zbl 0188.03601 · doi:10.1016/S0019-9958(69)90379-9
[274] R. Knast, ?Finite-state probabilistic languages,? Inf. Control,21, No. 2, 148?170 (1972). · Zbl 0264.68026 · doi:10.1016/S0019-9958(72)90069-1
[275] Komiya Noriaki, ?Some properties of probabilistic automata with pushdown tape,? Rev. Radio Res. Lab.,17, No. 90, 236?243 (1971).
[276] S. Rao Kosaraju, ?Probabilistic automata ? a problem of Paz,? Inf. Control,23, No. 1, 97?104 (1973). · Zbl 0263.94021 · doi:10.1016/S0019-9958(73)90928-5
[277] S. Rao Kosaraju, ?A note on probabilistic input-output relations,? Inf. Control,26, No. 2, 194?197 (1974). · Zbl 0292.68022 · doi:10.1016/S0019-9958(74)90484-7
[278] W. Kuich and K. Walk, ?Block-stochastic matrices and associated finite-state languages,? Computing,1, No. 1, 50?61 (1966). · Zbl 0138.15304 · doi:10.1007/BF02235852
[279] Eaves B. Kurtis, ?Polymatrix games with joint constraints,? SIAM J. Appl. Math.,24, No. 3, 418?423 (1973). · Zbl 0253.90067 · doi:10.1137/0124043
[280] H. Künstler, ?Algebren endlicher stochastischer Automaten und ihrer Verhaltensfunktionen. I,? Elektron. Inf. Kybern.,11, No. 1?2, 61?116 (1975). · Zbl 0324.94038
[281] Toshiro Kutsuwa, Hideo Kosako, and Yoshiaki Kojima, ?Some questions in the analysis of stochastic sequential machines,? Trans. Inst. Electron. Commun. Eng. Jpn.,A56, No. 1, 1?8 (1973).
[282] S. Lakshmivarahan and M. A. L. Thatchachar, ?Optimal nonlinear reinforcement schemes for stochastic automata,? Inf. Sci. (USA),4, No. 2, 121?128 (1972). · doi:10.1016/S0020-0255(72)80007-0
[283] S. Lakshmivarahan, ?Absolutely expedient learning algorithms for stochastic automata,? Trans. Syst., Man Cybern.,3, No. 3, 281?286 (1973). · Zbl 0258.94042
[284] S. Lakshmivarahan, ?Bayesian learning and reinforcement schemes for stochastic automata,? Proc. Int. Conf. Cybern. Soc. Washington, D. C. 1972, New York (1972), pp. 369?372.
[285] E. Latikka, ?On density of output probabilities in ergodic probabilistic automata,? Turun Yliopiston Julk. Sar.A1, No. 158 (1973). · Zbl 0269.94027
[286] W. E. Lewis, ?Stochastic sequential machines; theory and applications,? Doct. Diss., Northwestern Univ. (1966); Dissert. Abstr.,B27, No. 8, 2782?2783 (1967).
[287] C. L. Liu, ?A note on definite stochastic sequential machines,? Inf. Control,14, No. 4, 407?421 (1969). · Zbl 0179.31705 · doi:10.1016/S0019-9958(69)90106-5
[288] A. A. Lorents (Lorenc), ?On a synthesis of generation of stable probability distributions,? Inf. Control24, No. 3, 212?230 (1974). · Zbl 0277.94040 · doi:10.1016/S0019-9958(74)80037-9
[289] B. W. Lovell, ?The incompletely specified finite-state stochastic sequential machine: equivalence and reduction,? IEEE Conf. Rec. 10th Ann. Sympos. Switch and Automata Theory, Waterloo, 1969, New York (1969), pp. 82?89.
[290] R. W. Maclaren, ?A stochastic model for the synthesis of learning systems,? IEEE Trans. Syst. Cybern.,2 (1966).
[291] M. Magidor and G. Moran, ?Probabilistic tree automata and context-free languages,? Isr. J. Math.,8, No. 4, 340?348 (1970). · Zbl 0207.02003 · doi:10.1007/BF02798680
[292] M. M. Matluk and A. Gill, ?Decomposition of linear sequential circuits: residue and class rings,? J. Franklin Inst.,294, No. 3, 167?180 (1972). · Zbl 0277.94024 · doi:10.1016/0016-0032(72)90012-9
[293] Gr. C. Moisil, ?Fenomene de indeterminism la automatele cu relee temporizate,? An. Univ. Timisoara. Ser. Sti. Mat.,7, No. 1, 91?94 (1969).
[294] Kumpati S. Narendra and M. A. L. Thatchachar, ?Learning automata ? a survey,? IEEE Trans. Syst., Man Cybern.,4, No. 4, 323?324 (1974). · Zbl 0279.68067 · doi:10.1109/TSMC.1974.5408453
[295] Kumpati S. Narendra and R. Viswanathan, ?A two-level system of stochastic automata for periodic random environments,? IEEE Trans. Syst., Man Cybern.,2, No. 2, 285?289 (1972). · Zbl 0237.94021
[296] Kumpati S. Narendra and R. Viswanathan, ?A note on the linear reinforcement scheme for variable structure stochastic automata,? IEEE Trans. Syst., Man Cybern.,2, No. 2, 292?294 (1972). · Zbl 0231.93040
[297] Kumpati S. Narendra and R. Viswanathan, ?Stochastic automata model with applications to learning systems,? IEEE Trans. Syst., Man Cybern.,3, No. 1, 107?111 (1973). · Zbl 0254.94061
[298] Kumpati S. Narendra and R. Viswanathan, ?On variable-structure stochastic automata models and optimal convergence,? Proc. 5th Ann. Princeton Conf. Inf. Sci. Syst., Princeton, New Jersey (1971), pp. 410?414.
[299] Nasu Masakazu and Honda Namio, ?Fuzzy events realized by finite probabilistic automata,? Inf. Control,12, No. 4, 284?303 (1968). · Zbl 0162.02603 · doi:10.1016/S0019-9958(68)90353-7
[300] Nasu Masakazu and Honda Namio, ?A context-free language which is not accepted by a probabilistic automata (manuscript), Inf. Control,18, No. 3, 233?236 (1971). · Zbl 0218.68012 · doi:10.1016/S0019-9958(71)90373-1
[301] K. Nawrotzki, ?Eine Bermerkung zur Beduktion stochastischer Automaten,? Elektron. Inf. Kybern.,2, No. 3 (1966).
[302] K. Nawrotzki, ?Zur Minimalisierung stochastischer Automaten,? Elektron. Inf. Kybern.,8, No. 10, 623?631 (1972). · Zbl 0338.94033
[303] K. Nawrotzki and D. Richter, ?Eine Bemerkung zum allgemeinen Reduktionsproblem von P. H. Starke,? Elektron. Inf. Kybera.,10, No. 8?9, 481?487 (1974).
[304] T. T. Nieh, ?Stochastic sequential machines with prescribed performance criteria,? Inf. Control,13, No. 2, 99?113 (1968). · Zbl 0177.01906 · doi:10.1016/S0019-9958(68)90714-6
[305] T. T. Nieh and J. W. Carlyle, ?On the deterministic realization of stochastic finite-state machines,? Proc. 2nd Ann. Princeton Conf. Inform. Sci. Syst. (1960).
[306] C. J. Nihoul, ?La transformée stochastique et l’étude des systemes non linéaires,? Bull. Scient. A. I. M.,76, No. 8?9, 803?817 (1963).
[307] Octav Onicescu and Silvlu Guiasu, ?Finite abstract random automata,? Z. Wahrscheinlichkeitstheorie Geb.,3, No. 4, 279?285 (1965). · Zbl 0134.37604 · doi:10.1007/BF00535779
[308] Branko Ostojic, ?Teorija stochastickoga automata zasnovanana neformalnim neuronskim mrezama,? Dokt. Dis. Sveuciliste u Rijeci. Then. Fak. Eijeka (1974), p. 157.
[309] E. H. Ott, ?Theory and application of stochastic sequential machines,? Sperry Rand Res. Center, Research Paper, Sudburg, Mass. (1966).
[310] E. H. Ott, ?Reconsideration of the state minimization problem for stochastic finite-state systems,? IEEE Conf. Rec. 7th Ann. Sympos. of Switch. Circuit and Automata Theory (1966).
[311] C. V. Page, ?Equivalences between probabilistic and deterministic sequential machines,? Inf. Control,9, No. 5, 469?520 (1966). · Zbl 0151.24801 · doi:10.1016/S0019-9958(66)80012-8
[312] C. V. Page, ?Strong stability problems for probabilistic sequential machines,? Inf. Control,15, No. 6, 487?509 (1969). · Zbl 0188.03403 · doi:10.1016/S0019-9958(69)90530-0
[313] C. V. Page, ?The search for a definition of partition pair for stochastic automata,? IEEE Trans. Comput.,19, No. 2, 1222?1223 (1970). · Zbl 0239.94066 · doi:10.1109/T-C.1970.222864
[314] A. C. Pan, ?State identification and homing experiments for stochastic sequential machines,? Proc. 4th Haw. Int. Conf. Syst. Sci., Honolulu, Hawaii, 1971, North Hollywood Calif. (1971), pp. 498?500.
[315] J. J. Paredaens, ?Finite stochastic automata with variable transition probabilities,? Computing,11, No. 1, 1?20 (1973). · Zbl 0264.68023 · doi:10.1007/BF02239466
[316] J. J. Paredaens, ?A general definition of stochastic automata,? Computing,13, No. 2, 93?105 (1974). · Zbl 0284.94015 · doi:10.1007/BF02246610
[317] Behrooz Parhami, ?Stochastic automata and the problems of reliability of sequential machines,? IEEE Trans. Comput.,21, No. 4, 388?391 (1972). · Zbl 0232.94033 · doi:10.1109/TC.1972.5008981
[318] A. Paz, ?Some aspects of probabilistic automata,? Inf. Control,9, No. 1, 26?60 (1966). · Zbl 0151.24703 · doi:10.1016/S0019-9958(66)90092-1
[319] A. Paz, ?Minimization theorems and techniques for sequential stochastic machines,? Inf. Control,11, No. 1?2, 155?166 (1967). · Zbl 0153.48804 · doi:10.1016/S0019-9958(67)90465-2
[320] A. Paz, ?Homomorphism between stochastic sequential machines and related problems,? Math. Syst. Theory,2, No. 3, 223?245 (1968). · Zbl 0167.27602 · doi:10.1007/BF01694007
[321] A. Paz, Introduction to Probabilistic Automata, Academic Press, New York (1971). · Zbl 0234.94055
[322] A. Paz, ?Definite and quasidefinite sets of stochastic matrices,? Proc. Am. Math. Soc.,16, 634?641 (1965). · Zbl 0149.13404 · doi:10.1090/S0002-9939-1965-0177996-8
[323] A. Paz, ?Fuzzy star functions, probabilistic automata, and their approximation by nonprobabilistic automata,? IEEE Conf. Rec. 8th Ann. Sympos. Switch. and Automata Theory, Austin, Texas 1967, New York (1967), p. 2.
[324] A. Paz, ?A finite set of n{\(\times\)}n stochastic matrices generating all n-dimensional probability vectors whose coordinates have finite expansion,? SIAM J. Control,5, No. 4, 545?554 (1969). · Zbl 0155.34603 · doi:10.1137/0305034
[325] A. Paz, ?Regular events in stochastic sequential machines,? IEEE Trans. Comput.,19, No. 5, 456?457 (1970). · Zbl 0201.01602 · doi:10.1109/T-C.1970.222945
[326] A. Paz, ?Formal series, finiteness properties, and decision problems,? Ann. Acad. Scient. Fennicae Suomalais. Tiedeakat. Toimituks,A-1, No. 493, 16 (1971). · Zbl 0241.94051
[327] A. Paz, ?Whirl decomposition of stochastic systems,? IEEE Trans. Comput.,20, No. 10, 1208?1211 (1971). · Zbl 0236.94043 · doi:10.1109/T-C.1971.223107
[328] A. Paz and M. Rabinovitz, ?Linear automata approximation problem,? IEEE Trans. Comput.,C-23, No. 3, 249?255 (1974). · Zbl 0296.94030 · doi:10.1109/T-C.1974.223919
[329] A. Paz and M. Reichard, ?Ergodic theorem for sequences of infinite stochastic matrices,? Proc. Cambr. Phil. Soc., 63 (1967).
[330] Phan Dinh Dieu, ?On a necessary condition for stochastic languages,? Elektron. Inf. Kybern.,8, No. 10 (1972). · Zbl 0339.94031
[331] Phan Dinh Dieu, ?On a class of stochastic languages,? Z. Math. Log. Grundl.,17, 421?425 (1971). · Zbl 0242.94047 · doi:10.1002/malq.19710170146
[332] M. O. Rabin, ?Probabilistic automata,? Inf. Control,6, No. 3, 230?245 (1963). · Zbl 0182.33602 · doi:10.1016/S0019-9958(63)90290-0
[333] M. O. Rabin, Lectures on Classical and Probabilistic Automata. Automata Theory, Academic Press, New York-London (1966), pp. 304?313. · Zbl 0192.07501
[334] C. de Rennae Souza, ?A theorem on the state reduction of synthesized stochastic machines,? IEEE Trans. Comput.,18, No. 5, 473?474 (1969). · Zbl 0174.03602
[335] S. T. Riberia, ?Random-pulse machines,? IEEE Trans. Electron. Comput.,16, No. 3, 216?276 (1967).
[336] I. Richardt, ?Zur Analyse und Synthese asynchroner stochastischer Automaten,? Elektron. Inf. Kybern.,10, No. 2?3, 123?132 (1974). · Zbl 0316.94061
[337] J. S. Riordan, ?Optimal feedback characteristics from stochastic automaton models,? IEEE Trans. Autom. Control,14, No. 1, 89?92 (1969). · doi:10.1109/TAC.1969.1099111
[338] W. Rytter, ?The strong stability problem for stochastic automata,? Bull. Acad. Pol. Sci. Ser. Sci. Math., Astron. Phys.,21, No. 3, 271?275 (1973). · Zbl 0258.94040
[339] W. Rytter, ?The dimension of strong stability of minimal-state stochastic automata,? Bull. Acad. Pol. Sci. Ser. Sci. Math., Astron. Phys.,21, No. 3, 277?279 (1973). · Zbl 0258.94041
[340] W. Rytter, ?Zagadnienie stabilnosci skonczonych stochastycznych,? Pr. CO PAN, No. 6, 38 (1972).
[341] W. Rytter, ?The dimension of stability of stochastic automata,? Inf. Control,24, No. 3, 201?211 (1974). · Zbl 0298.94064 · doi:10.1016/S0019-9958(74)80036-7
[342] A. Salomaa, ?On probabilistic automata with one input letter,? Turun Yliopiston Julk., Sar.AI, No. 85 (1965).
[343] A. Salomaa, ?On m-adic probabilistic automata,? Inf. Control,10, No. 2, 215?219 (1967). · Zbl 0155.34701 · doi:10.1016/S0019-9958(67)80009-3
[344] A. Salomaa, ?On events represented by probabilistic automata of different types,? Can. J. Math.,20, No. 1, 242?251 (1968). · Zbl 0157.02203 · doi:10.4153/CJM-1968-023-3
[345] A. Salomaa, ?On languages accepted by probabilistic and time-variant automata,? Proc. 2nd Ann. Princeton Conf. Inf. Sci. Systems (1968).
[346] A. Salomaa, ?Probabilistic and weighted grammars,? Inf. Control,15, No. 6, 529?544 (1970). · Zbl 0188.03201 · doi:10.1016/S0019-9958(69)90554-3
[347] E. S. Santos, ?Probabilistic Turing machines and computability,? Proc. Am. Math. Soc.,22, No. 3, 704?710 (1969). · Zbl 0186.01202 · doi:10.1090/S0002-9939-1969-0249221-4
[348] E. S. Santos, ?Fuzzy algorithms,? Inf. Control,17, No. 4, 326?339 (1970). · Zbl 0205.01303 · doi:10.1016/S0019-9958(70)80032-8
[349] E. S. Santos, ?Computability by probabilistic Turing machines,? Trans. Am. Math. Soc.,159, 165?184 (1971). · Zbl 0246.02030 · doi:10.1090/S0002-9947-1971-0281555-3
[350] E. S. Santos, ?Algebraic structure theory of stochastic machines,? Conf. Rec. 3rd Ann. ACM Symp. Theory Comput., Shaker Heights, Ohio, 1971, New York (1971), pp. 219?243.
[351] E. S. Santos, ?First and second covering problems of quasistochastic systems,? Inf. Control,20, No. 1, 20?37 (1972). · Zbl 0231.94053 · doi:10.1016/S0019-9958(72)90251-3
[352] E. S. Santos, ?Probabilistic grammars and automata,? Inf. Control,21, No. 1 (1972). · Zbl 0243.94053
[353] E. S. Santos, ?Identification of stochastic finite-state systems,? Inf. Control,21, No. 1 (1972). · Zbl 0242.93055
[354] E. S. Santos, ?A note on probabilistic grammars,? Inf. Control,25, No. 4, 393?394 (1974). · Zbl 0296.68080 · doi:10.1016/S0019-9958(74)91060-2
[355] E. S. Santos, ?Realizations of fuzzy languages by probabilistic, max-product, and maximin automata,? Inf. Sci. (USA),8, No. 1, 39?53 (1975). · Zbl 0313.68063 · doi:10.1016/0020-0255(75)90004-3
[356] E. S. Santos, ?State-splitting for stochastic machines,? SIAM J. Comput.,4, No. 1, 85?96 (1975). · Zbl 0274.94055 · doi:10.1137/0204008
[357] Sawaragi Yoshikazu and Baba Norio, ?Two E-optimal nonlinear reinforcement schemes for stochastic automata,? IEEE Trans. Syst., Man Cybern.,4, No. 1, 126?131 (1974). · Zbl 0276.94021
[358] Sawaragi Yoshikazu and Baba Norio, ?A note on the learning behavior of variable-structure stochastic automata,? IEEE Trans. Syst., Man Cybern.,3, No. 6, 644?647 (1973). · Zbl 0286.94052
[359] A. Schmitt, ?Vorhersage der Ausgabe stochastischer Automaten,? Mitt. Ges. Matt. Datenverarb., No. 8, 36?38 (1970). · Zbl 0232.94032
[360] A. Schmitt, ?Optimale Vorhersage der Ausgabe stochastischer Automaten über lange Zeiten Arbeitisber,? Inst. Math. Masch. Datenverarb.,3, No. 6 (1971).
[361] J. Shapiro and Kumpati S. Narendra, ?Use of stochastic automata for parameter self-optimization with multimodal performance criteria,? IEEE Trans. Syst. Sci. Cybern.,5, No. 4 (1969). · Zbl 0184.19401
[362] C. L. Sheng, ?Threshold logic elements used as a probability transformer,? J. Assoc. Comput. Math.,12, No. 2, 262?276 (1965). · Zbl 0156.17609 · doi:10.1145/321264.321278
[363] C. B. Silio, Jr., ?Synthesis of simplicial covering machines for stochastic finite state systems,? 6th Asilomar Conf. Circuits Syst., Pacific Grove, Calif., 1972, North Hollywood, Calif. (1973), pp. 202?208.
[364] C. de Rennae Souza, ?Probabilistic automata with monitored final state sets,? IEEE Trans. Comput.,20, No. 4, 448?450 (1971). · Zbl 0234.94056
[365] F. Stanciulescu and F. A. Oprescu, ?A mathematical model of finite random sequential automata,? IEEE Trans. Comput.,C-17, No. 1, 28?31 (1968). · Zbl 0155.34601
[366] F. Stanciulescu and F. A. Oprescu, ?Probabilisation de l’algebre sequentielle et simulation mathematique des automates sequentiels aleátoires,? Bull. Math. Soc. Sci. Rsr. Mat. RSF,12, No. 1, 123?132 (1968).
[367] P. H. Starke, ?Theorie stochastischen Automaten. I. Theorie stochastischen Automaten. II,? Elektron Inf. Kybern.,1, No. 2 (1965). · Zbl 0149.01003
[368] P. H. Starke, ?Stochastische Ereignisse und Wortmengen,? Z. Math. Log. Grundl. Math.,12, No. 1?2, 61?68 (1966). · Zbl 0163.01101 · doi:10.1002/malq.19660120108
[369] P. H. Starke, ?Stochastische Ereignisse und Stochastische Operatoren,? Elektron. Inf. Kybern.,2, No. 3 (1966). · Zbl 0149.01301
[370] P. H. Starke, ?Theory of stochastic automata,? Kybernetika,2, 475?482 (1966). · Zbl 0168.01305
[371] P. H. Starke, ?Die Reduktion von stochastischen Automaten,? Elektron. Inf. Kybern.,4, No. 2, 93?99 (1968). · Zbl 0157.02301
[372] P. H. Starke, ?Über die Minimalisierung von stochastischen Rabin-Automaten,? Elektron. Inf. Kybern.,5, No. 3, 153?170 (1969). · Zbl 0184.28704
[373] P. H. Starke, Abstrakte Automaten, VEB Deutsch. Verl. Wiss., Berlin (1969).
[374] P. H. Starke, ?Schwache Homomorphismen fur stochastische Automaten,? Z. Math. Log. Grundl. Math.,15, No. 5, 421?429 (1969). · Zbl 0193.33303 · doi:10.1002/malq.19690152603
[375] P. H. Starke, ?Einige Bemerkungen über asynchrone stochastische Automaten,? Suomalais, Tiedeakat, Toimituks, Ser. AI, No. 491, 21 (1971). · Zbl 0248.94069
[376] P. H. Starke and H. Thiele, ?Zufällige Zustände in stochastischen Automaten,? Elektron. Inf. Kybern.,3, No. 1, 25?37 (1967). · Zbl 0163.01003
[377] P. H. Starke and H. Thiele, ?On asynchronous stochastic automata,? Inf. Control,17, No. 3, 265?293 (1970). · Zbl 0248.94068 · doi:10.1016/S0019-9958(70)90458-4
[378] P. H. Starke and H. Thiele, ?Über asynchrone stochastische Automaten,? Ber. Math. Forschungsinst. Oberwolfach,3, No. 3, 129?142 (1970). · Zbl 0248.94067
[379] K. Sugino, Y. Inagaki, and T. Fukumura, ?On analysis of a probabilistic automaton by its state characteristic equation,? Trans. Inst. Electr. Commun. Eng. Jpn.,51-C, No. 1, 29?36 (1968).
[380] J. Sustal, ?The degree of distinguishability of stochastic sequential machines and related problems,? Elektron. Inf. Kybern.,10, No. 4, 203?214 (1974).
[381] J. Sustal, ?On the size of the set of all reducible stochastic sequential machines,? Inf. Control,26, 301?311 (1974). · Zbl 0298.94063 · doi:10.1016/S0019-9958(74)80001-X
[382] P. Szynal and S. Janick, ?Some remarks on extension of finite sets of stochastic automata,? Bull. Acad. Pol. Sci. Ser. Sci. Math., Astron. Phys.,23, No. 2, 183?187 (1975).
[383] Akihiro Takeuschi and Tadahiro Kitahashi, ?Interaction between random media and stochastic automata,? Trans. Inst. Electron. Commun. Eng. Jpn.,A55, No. 10, 569?570 (1972).
[384] Akihiro Takeuschi and Tadahiro Kitahashi, ?On the behavior of stochastic automata in environments reacting to those outputs in random fashion,? Trans. Inst. Electron. Commun. Eng. Jpn.,55D, No. 9, 587?593 (1972).
[385] Akihiro Takeuschi, Tadahiro Kitahashi, and Kohkichi Tanaka, ?Random environments and automata,? Inf. Sci. (USA),8, No. 2, 141?154 (1975). · Zbl 0326.94038 · doi:10.1016/0020-0255(75)90011-0
[386] Akihiro Takeuschi, Tadahiro Kitahashi, and Kohkichi Tanaka, ?The behavior of a stochastic automaton in a random medium,? Trans. Inst. Electron Commun. Eng. Jpn.,C54, No. 10, 949?950 (1971).
[387] Tan Choon Peng, ?On two-state isolated probabilistic automata,? Inf. Control,21, No. 5, 483?495 (1972). · Zbl 0256.94061 · doi:10.1016/S0019-9958(72)90157-X
[388] N. Tandareanu, ?Functions associated to a partition on the state set of a probabilistic automaton,? Inf. Control,28, No. 4, 304?313 (1975). · Zbl 0315.94052 · doi:10.1016/S0019-9958(75)90320-4
[389] A. J. Thomasian, ?A finite criterion for indecomposable channels,? Ann. Math. Statist.,34, No. 1, 337?338 (1963). · Zbl 0113.12004 · doi:10.1214/aoms/1177704274
[390] P. Turakainen, ?On nonregular events representable in probabilistic automata with one input letter,? Turun Yliopiston Julk., Sar.AI, No. 90, 14 (1966).
[391] P. Turakainen, ?Äärellisistä ja stokastisista automaateista,? Arkhimedes, No. 2, 16?20 (1967).
[392] P. Turakainen, ?On m-adic stochastic languages,? Inf. Control,17, No. 4, 410?415 (1976). · Zbl 0205.31504 · doi:10.1016/S0019-9958(70)80036-5
[393] P. Turakainen, ?On probabilistic automata and their generalizations,? Soumalais, Tiedeakat. Toimituks, 53 (1968). · Zbl 0179.02502
[394] P. Turakainen, ?On time-variant probabilistic automata with monitors,? Turun Yliopiston Julk., Sar. A, No. 130 (1969). · Zbl 0176.28105
[395] P. Turakainen, ?The family of stochastic languages is closed neither under catenation nor under homomorphism,? Turun Yliopiston Julk., Sar. AI, No. 133 (1970). · Zbl 0188.33303
[396] P. Turakainen, ?On stochastic languages,? Inf. Control,12, No. 4, 304?313 (1968). · Zbl 0214.02101 · doi:10.1016/S0019-9958(68)90360-4
[397] P. Turakainen, ?On languages representable in rational probabilistic automata,? Suomalais, Tiedeakat. Toimituks, Sar. AI,10, No. 439 (1969). · Zbl 0174.29003
[398] P. Turakainen, ?Generalized automata and stochastic languages,? Prop. Am. Math. Soc.,21, No. 2, 303?309 (1969). · Zbl 0184.02802 · doi:10.1090/S0002-9939-1969-0242596-1
[399] P. Turakainen, ?On multistochastic automata,? Inf. Control,23, No. 2, 183?203 (1973). · Zbl 0262.94036 · doi:10.1016/S0019-9958(73)90667-0
[400] P. Turakainen, ?Some closure properties of the family of stochastic languages,? Inf. Control,18, No. 3, 253?256 (1971). · Zbl 0218.68013 · doi:10.1016/S0019-9958(71)90391-3
[401] P. Turakainen, ?Some remarks on multistochastic automata,? Inf. Control,27, No. 1, 75?86 (1975). · Zbl 0292.94042 · doi:10.1016/S0019-9958(75)90082-0
[402] S. G. Tzafestas, ?State estimation algorithms for nonlinear stochastic sequential machines,? Comput. J.,16, No. 3, 245?253 (1973). · Zbl 0275.94042 · doi:10.1093/comjnl/16.3.245
[403] R. Viswanathan and Kumpati S. Narendra, ?Convergence rates of optimal variable structure stochastic automata,? Syst. Seventies Proc. IEEE Syst. Sci. and Cybern. Conf., Pittsburgh, Pa. (1970), pp. 147?153.
[404] R. Viswanathan and Kumpati S. Narendra, ?Games of stochastic automata,? IEEE Trans. Syst., Man Cybern.,4, No. 1, 131?135 (1974). · Zbl 0294.94031 · doi:10.1109/TSMC.1974.5408539
[405] J. N. Warfield, ?Synthesis of switching circuits to yield prescribed probability relations,? IEEE Conf. Rec. Switch. Circuit Theory and Logic. Design, Ann Arbor, Mich. (1965).
[406] W. Wes and K. S. Fu, ?A formulation of fuzzy automata and its application as a model of a learning system,? Syst. Sci. Cybern.,5, No. 3, 215?223 (1969). · Zbl 0188.33203 · doi:10.1109/TSSC.1969.300263
[407] G. M. White, ?Penny matching machines,? Inf. Control,2, No. 4, 349?363 (1959). · Zbl 0091.16205 · doi:10.1016/S0019-9958(59)80013-9
[408] D. G. Willis, ?Computational complexity and probability constructions,? J. Assoc. Comput. Mach.,17, No. 2, 241?259 (1970). · Zbl 0233.68013 · doi:10.1145/321574.321578
[409] J. Winkowski, ?A method of realization of Markov chains,? Algorythmy, No. 9 (1968). · Zbl 0177.45602
[410] T. Yasui and S. Yajima, ?Two-state two-symbol probabilistic automata,? Inf. Control, No. 3, 203?224 (1970). · Zbl 0211.02201 · doi:10.1016/S0019-9958(70)90114-2
[411] T. Yasui and S. Yajima, ?Some algebraic properties of sets of stochastic matrices,? Inf. Control,14, No. 4 (1969). · Zbl 0197.28601
[412] A. L. Zadeh, ?Fuzzy sets,? Inf. Control,8, 338?353 (1965). · Zbl 0139.24606 · doi:10.1016/S0019-9958(65)90241-X
[413] A. L. Zadeh, ?Communicaton: fuzzy algorithms,? Inf. Control,12, No. 2, 94?102 (1968). · Zbl 0182.33301 · doi:10.1016/S0019-9958(68)90211-8
[414] K. A. Zech, ?Homomorphe decomposition stochastischer und nicht deterministischer Automaten,? Elektron Inf. Kybern.,7, No. 5?6, 297?315 (1971). · Zbl 0275.94041
[415] K. A. Zech, ?Eine Bemerkung über stochastische Wahrheitsfunktionen und ihre Anwendung in der Strukturtheorie stochastischer Automaten,? Elektron. Inf. Kybern.,7, No. 8, 505?512 (1971). · Zbl 0268.94050
[416] H. Zunlke, ?Ersetzbarkeit von stochastischen Automaten,? Wiss. Z. Friederich Schiller Univ., Jena, Math. Naturwiss. Reihe,18, No. 2, 279?283 (1969).
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.