Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
Davis, A.S., Markov chains as random input automata. Amer.Math. Monthly,68(1961),no.3,264–267.
Buharajev, R.G., Verojatnostnyje avtomaty. Izdatel'stvo Kazanskogo universiteta, Kazan, 1977, p. 248. (Russian).
Metra,I.A., Zamečanija o minimal'nom implitsirujuščem vektore dlia stohastičesko\(\overset{\lower0.5em\hbox{$\smash{\scriptscriptstyle\smile}$}}{\imath }\) matritsy. AVT (1970), no.5, 95–96. (Russian).
Gabbasov, N.Z., O nahoždenii minimal'nogo implitsirujuščego, vektora. Verojatnostnyje metody i kibernetika, vypusk 20, izdatel stvo Kazanskogo universiteta, Kazan (1984), 29–40. (Russian).
Gabbasov,N.Z., O postrojenii minimal'nogo implitsirujuščego vektora dlia lineinyh avtomatov. Tezisy dokladov III Vsesojuznogo simpoziuma "Verojatnostnyje avtomaty i ih priloženija", Kazan (1983), 89. (Russian).
Gabbasov,N.Z., O minimal'nom implitsirujuščem vektore dlia lineinyh avtomatov. Verojatnostnyje avtomaty i ih priloženija, izdat. Kazanskogo universiteta, Kazan (1986), 78–83. (Russian).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gabbasov, N.Z. (1987). The implicating vector problem and its applications to probabilistic and linear automata. In: Budach, L., Bukharajev, R.G., Lupanov, O.B. (eds) Fundamentals of Computation Theory. FCT 1987. Lecture Notes in Computer Science, vol 278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18740-5_31
Download citation
DOI: https://doi.org/10.1007/3-540-18740-5_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18740-0
Online ISBN: 978-3-540-48138-6
eBook Packages: Springer Book Archive