Standard
On Closed-Rich Words. / Parshina, Olga; Puzynina, Svetlana.
Computer Science – Theory and Applications: 16th International Computer Science Symposium in Russia, CSR 2021, Sochi, Russia, June 28–July 2, 2021, Proceedings. ed. / Rahul Santhanam; Daniil Musatov. Springer Nature, 2021. p. 381-394 (Lecture Notes in Computer Science ; Vol. 12730 LNCS).
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
Harvard
Parshina, O & Puzynina, S 2021,
On Closed-Rich Words. in R Santhanam & D Musatov (eds),
Computer Science – Theory and Applications: 16th International Computer Science Symposium in Russia, CSR 2021, Sochi, Russia, June 28–July 2, 2021, Proceedings. Lecture Notes in Computer Science , vol. 12730 LNCS, Springer Nature, pp. 381-394, 16th International Computer Science Symposium in Russia, CSR 2021, Sochi, Russian Federation,
28/06/21.
https://doi.org/10.1007/978-3-030-79416-3_23
APA
Parshina, O., & Puzynina, S. (2021).
On Closed-Rich Words. In R. Santhanam, & D. Musatov (Eds.),
Computer Science – Theory and Applications: 16th International Computer Science Symposium in Russia, CSR 2021, Sochi, Russia, June 28–July 2, 2021, Proceedings (pp. 381-394). (Lecture Notes in Computer Science ; Vol. 12730 LNCS). Springer Nature.
https://doi.org/10.1007/978-3-030-79416-3_23
Vancouver
Parshina O, Puzynina S.
On Closed-Rich Words. In Santhanam R, Musatov D, editors, Computer Science – Theory and Applications: 16th International Computer Science Symposium in Russia, CSR 2021, Sochi, Russia, June 28–July 2, 2021, Proceedings. Springer Nature. 2021. p. 381-394. (Lecture Notes in Computer Science ).
https://doi.org/10.1007/978-3-030-79416-3_23
Author
Parshina, Olga ; Puzynina, Svetlana. /
On Closed-Rich Words. Computer Science – Theory and Applications: 16th International Computer Science Symposium in Russia, CSR 2021, Sochi, Russia, June 28–July 2, 2021, Proceedings. editor / Rahul Santhanam ; Daniil Musatov. Springer Nature, 2021. pp. 381-394 (Lecture Notes in Computer Science ).
BibTeX
@inproceedings{d21ad14e335c444d9cb3d11cf86905f6,
title = "On Closed-Rich Words",
abstract = "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 the maximal number of closed factors in a word of length n. We show that it is quadratic and give lower and upper bounds for a constant.",
keywords = "Closed word, Return word, Rich word",
author = "Olga Parshina and Svetlana Puzynina",
note = "Parshina O., Puzynina S. (2021) On Closed-Rich Words. In: Santhanam R., Musatov D. (eds) Computer Science – Theory and Applications. CSR 2021. Lecture Notes in Computer Science, vol 12730. Springer, Cham. https://doi.org/10.1007/978-3-030-79416-3_23; 16th International Computer Science Symposium in Russia, CSR 2021 ; Conference date: 28-06-2021 Through 02-07-2021",
year = "2021",
doi = "10.1007/978-3-030-79416-3_23",
language = "English",
isbn = "9783030794156",
series = "Lecture Notes in Computer Science ",
publisher = "Springer Nature",
pages = "381--394",
editor = "Rahul Santhanam and Daniil Musatov",
booktitle = "Computer Science – Theory and Applications",
address = "Germany",
}
RIS
TY - GEN
T1 - On Closed-Rich Words
AU - Parshina, Olga
AU - Puzynina, Svetlana
N1 - Parshina O., Puzynina S. (2021) On Closed-Rich Words. In: Santhanam R., Musatov D. (eds) Computer Science – Theory and Applications. CSR 2021. Lecture Notes in Computer Science, vol 12730. Springer, Cham. https://doi.org/10.1007/978-3-030-79416-3_23
PY - 2021
Y1 - 2021
N2 - 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 the maximal number of closed factors in a word of length n. We show that it is quadratic and give lower and upper bounds for a constant.
AB - 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 the maximal number of closed factors in a word of length n. We show that it is quadratic and give lower and upper bounds for a constant.
KW - Closed word
KW - Return word
KW - Rich word
UR - http://www.scopus.com/inward/record.url?scp=85111855655&partnerID=8YFLogxK
UR - https://www.mendeley.com/catalogue/2682db61-eb46-3217-af02-bdad2da71383/
U2 - 10.1007/978-3-030-79416-3_23
DO - 10.1007/978-3-030-79416-3_23
M3 - Conference contribution
AN - SCOPUS:85111855655
SN - 9783030794156
T3 - Lecture Notes in Computer Science
SP - 381
EP - 394
BT - Computer Science – Theory and Applications
A2 - Santhanam, Rahul
A2 - Musatov, Daniil
PB - Springer Nature
T2 - 16th International Computer Science Symposium in Russia, CSR 2021
Y2 - 28 June 2021 through 2 July 2021
ER -
