Voir la notice de l'article provenant de la source Math-Net.Ru
@article{DM_2013_25_3_a5, author = {A. A. Petushko}, title = {On bigram languages}, journal = {Diskretnaya Matematika}, pages = {64--77}, publisher = {mathdoc}, volume = {25}, number = {3}, year = {2013}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/DM_2013_25_3_a5/} }
A. A. Petushko. On bigram languages. Diskretnaya Matematika, Tome 25 (2013) no. 3, pp. 64-77. http://geodesic.mathdoc.fr/item/DM_2013_25_3_a5/
[1] Markov A. A., “Primer statisticheskogo issledovaniya nad tekstom “Evgeniya Onegina”, illyustriruyuschii svyaz ispytanii v tsep”, Izvestiya Imperatorskoi Akademii nauk. Seriya 6, 7:3 (1913), 153–162 | Zbl
[2] Essen U., Steinbiss V., “Cooccurrence smoothing for stochastic language modeling”, IEEE International Conference on Acoustics, Speech, and Signal Processing, v. 1, 1992, 161–164
[3] Hutchinson J. P., Wilf H. S., “On eulerian circuits and words with prescribed adjacency patterns”, J. Combinatorial Theory. Ser. A, 18 (1975), 80–87 | DOI | MR | Zbl
[4] Ore O., Teoriya grafov, Nauka, Moskva, 1980 | MR
[5] Kleene S. C., “Representation of events in nerve nets and finite automata”, Automata Studies, eds. Shannon C., McCarthy J., Princeton University Press, Princeton, 1956, 3–41 | MR
[6] Kudryavtsev V. B., Aleshin S. V., Podkolzin A. S., Vvedenie v teoriyu avtomatov, Nauka, Moskva, 1985 | MR | Zbl
[7] Smirnov N. V., Sarmanov O. V., Zakharov V. K., “Lokalnaya predelnaya teorema dlya chisel perekhodov v tsepi Markova i ee primeneniya”, DAN SSSR, 167:6 (1966), 1238–1241 ; Смирнов Н. В., “Теория вероятностей и математическая статистика”, Избранные труды, Наука, Москва, 1970, 260–264 | MR | MR