Zobrazeno 1 - 10
of 64
pro vyhledávání: '"Parshina, Olga"'
Publikováno v:
In Journal of Experimental Child Psychology January 2025 249
Autor:
Parshina, Olga, Puzynina, Svetlana
A word is called closed if it has a prefix which is also its suffix and there is no internal occurrences of this prefix in the word. In this paper we study words that are rich in closed factors, i.e., which contain the maximal possible number of dist
Externí odkaz:
http://arxiv.org/abs/2111.00863
Autor:
Parshina, Olga
Cette thèse est composée de deux parties : l’une traite des propriétés combinatoires de mots infinis et l’autre des problèmes de colorations des graphes.La première partie du manuscrit concerne les structures régulières dans les mots apé
Externí odkaz:
http://www.theses.fr/2019LYSE1071/document
Autor:
Parshina, Olga, Puzynina, Svetlana
Publikováno v:
In Theoretical Computer Science 12 February 2024 984
Autor:
Parshina, Olga
Publikováno v:
In: Brlek S., Dolce F., Reutenauer C., Vandomme E. (eds) Combinatorics on Words. WORDS 2017. Lecture Notes in Computer Science, 10432 (2017), Springer, Cham, pp. 121-131
Let $q$ be a positive integer. Consider an infinite word $\omega=w_0w_1w_2\cdots$ over an alphabet of cardinality $q$. A finite word $u$ is called an arithmetic factor of $\omega$ if $u=w_cw_{c+d}w_{c+2d}\cdots w_{c+(|u|-1)d}$ for some choice of posi
Externí odkaz:
http://arxiv.org/abs/1811.03884
Autor:
Parshina, Olga, Zamboni, Luca
A finite word $u$ is called closed if its longest repeated prefix has exactly two occurrences in $u,$ once as a prefix and once as a suffix. We study the function $f_x^c:\mathbb N \rightarrow \mathbb N$ which counts the number of closed factors of ea
Externí odkaz:
http://arxiv.org/abs/1810.05472
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Parshina, Olga1 (AUTHOR) oparshina@middlebury.edu, Zdorova, Nina2,3 (AUTHOR), Kuperman, Victor4 (AUTHOR)
Publikováno v:
Quarterly Journal of Experimental Psychology. Aug2024, Vol. 77 Issue 8, p1694-1702. 9p.
Autor:
Parshina, Olga, Zamboni, Luca Q.
Publikováno v:
In Advances in Applied Mathematics June 2019 107:22-31
Autor:
Parshina, Olga1 (AUTHOR) oparshina@hse.ru, Lopukhina, Anastasiya1,2 (AUTHOR), Goldina, Sofya1 (AUTHOR), Iskra, Ekaterina1,3 (AUTHOR), Serebryakova, Margarita3 (AUTHOR), Staroverova, Vladislava1 (AUTHOR), Zdorova, Nina1,4 (AUTHOR), Dragoy, Olga1,4 (AUTHOR)
Publikováno v:
Annals of Dyslexia. Oct2022, Vol. 72 Issue 3, p403-425. 23p. 5 Charts, 7 Graphs.