Voir la notice de l'article provenant de la source Math-Net.Ru
@article{DM_2014_26_2_a5, author = {A. A. Petyushko}, title = {On cardinality of bigram languages}, journal = {Diskretnaya Matematika}, pages = {71--82}, publisher = {mathdoc}, volume = {26}, number = {2}, year = {2014}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/DM_2014_26_2_a5/} }
A. A. Petyushko. On cardinality of bigram languages. Diskretnaya Matematika, Tome 26 (2014) no. 2, pp. 71-82. http://geodesic.mathdoc.fr/item/DM_2014_26_2_a5/
[1] Markov A. A., “Primer statisticheskogo issledovaniya nad tekstom “Evgeniya Onegina”, illyustriruyuschii svyaz ispytanii v tsep”, Izvestiya Imperatorskoi Akademii nauk. Ser. 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, 1 (1992), 161–164
[3] Hutchinson J. P., Wilf H. S., “On eulerian circuits and words with prescribed adjacency patterns”, J. Comb. Theory, 18 (1975), 80–87 | DOI | MR | Zbl
[4] Petyushko A. A., “O bigrammnykh yazykakh”, Diskretnaya matematika, 25:3 (2013), 64–77 | DOI | MR
[5] Ore O., Teoriya grafov, Nauka, Moskva, 1980 | MR
[6] Chung F. R. K., Spectral graph theory, Amer. Math. Soc., Providence, RI, 1997 | MR
[7] Kim K. H., Roush F., “Words with prescribed adjacencies”, J. Comb. Theory, 26:1 (1979), 85–97 | MR | Zbl