1. 2024
  2. Finite and infinite closed-rich words.

    Parshina, O. G. & Puzynina, S., 12 Feb 2024, In: Theoretical Computer Science. 984, 114315.

    Research output: Contribution to journalArticlepeer-review

  3. 2021
  4. ON CLOSED FACTORS, COMPLEXITY AND PERIODICITY IN INFINITE SEQUENCES

    Parshina, O. G., 2021, p. 635. 1 p.

    Research output: Contribution to conferencePaper

  5. On Closed-Rich Words

    Parshina, O. & Puzynina, S., 2021, Computer Science – Theory and Applications: 16th International Computer Science Symposium in Russia, CSR 2021, Sochi, Russia, June 28–July 2, 2021, Proceedings. Santhanam, R. & Musatov, D. (eds.). Springer Nature, p. 381-394 14 p. (Lecture Notes in Computer Science ; vol. 12730 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

ID: 62783382