LANGUAGES REPRESENTABLE BY FINITE PROBABILISTIC AUTOMATA

[1] BUKHARAEV R, 1967, PROB METHODS CYBERNE, P7

[2] BUKHARAEV R, 1968, KIBERNETIKA, V2, P6

[3] Ceitin G. S., 1962, T MAT I STEKOV, V67, P362

[4] CHOMSKY N, 1963, HDB MATH PSYCHOL, V2, P328

[5] ON COMPUTATIONAL COMPLEXITY OF ALGORITHMS [J]. TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1965, 117 (05) : 285 - +

[6] COMPUTATIONAL COMPLEXITY OF ONE-TAPE TURING MACHINE COMPUTATIONS [J]. JOURNAL OF THE ACM, 1968, 15 (02) : 325 - +

[7] ONE-TAPE OFF-LINE TURING MACHINE COMPUTATIONS [J]. INFORMATION AND CONTROL, 1965, 8 (06): : 553 - &

[8] RELATIONS BETWEEN TIME AND TAPE COMPLEXITIES [J]. JOURNAL OF THE ACM, 1968, 15 (03) : 414 - &

[9] CLASSES OF LANGUAGES + LINEAR-BOUNDED AUTOMATA [J]. INFORMATION AND CONTROL, 1964, 7 (02): : 207 - &

[10] Markov A. A., 1958, T MATEM I VA STEKLOV, V52, P315

[1] BUKHARAEV R, 1967, PROB METHODS CYBERNE, P7

[2] BUKHARAEV R, 1968, KIBERNETIKA, V2, P6

[3] Ceitin G. S., 1962, T MAT I STEKOV, V67, P362

[4] CHOMSKY N, 1963, HDB MATH PSYCHOL, V2, P328

[5] ON COMPUTATIONAL COMPLEXITY OF ALGORITHMS [J]. TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1965, 117 (05) : 285 - +

[6] COMPUTATIONAL COMPLEXITY OF ONE-TAPE TURING MACHINE COMPUTATIONS [J]. JOURNAL OF THE ACM, 1968, 15 (02) : 325 - +

[7] ONE-TAPE OFF-LINE TURING MACHINE COMPUTATIONS [J]. INFORMATION AND CONTROL, 1965, 8 (06): : 553 - &

[8] RELATIONS BETWEEN TIME AND TAPE COMPLEXITIES [J]. JOURNAL OF THE ACM, 1968, 15 (03) : 414 - &

[9] CLASSES OF LANGUAGES + LINEAR-BOUNDED AUTOMATA [J]. INFORMATION AND CONTROL, 1964, 7 (02): : 207 - &

[10] Markov A. A., 1958, T MATEM I VA STEKLOV, V52, P315