1 - 10 out of 11Page size: 10
  1. 2022

  2. Abelian Repetition Threshold Revisited

    Petrova, E. A. & Shur, A. M., 2022, Computer Science – Theory and Applications - 17th International Computer Science Symposium in Russia, CSR 2022, Proceedings. Kulikov, A. S. & Raskhodnikova, S. (eds.). Springer, p. 302-319 18 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13296 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  3. 2021

  4. Branching densities of cube-free and square-free words

    Petrova, E. A. & Shur, A. M., Apr 2021, In: Algorithms. 14, 4, 19 p., 126.

    Research output: Contribution to journal › Article › peer-review

  5. Transition Property for Cube-Free Words

    Petrova, E. A. & Shur, A. M., Apr 2021, In: Theory of Computing Systems. 65, 3, p. 479-496 18 p.

    Research output: Contribution to journal › Article › peer-review

  6. Branching Frequency and Markov Entropy of Repetition-Free Languages

    Petrova, E. A. & Shur, A. M., 2021, Developments in Language Theory - 25th International Conference, DLT 2021, Proceedings. Moreira, N. & Reis, R. (eds.). Springer, p. 328-341 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12811 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  7. 2019

  8. Transition property for cube-free words

    Petrova, E. A. & Shur, A. M., 1 Jan 2019, Computer Science – Theory and Applications - 14th International Computer Science Symposium in Russia, CSR 2019, Proceedings. Kucherov, G. & van Bevern, R. (eds.). Springer Verlag, Vol. 11532. p. 311-324 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11532 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  9. 2017

  10. On the tree of binary cube-free words

    Petrova, E. A. & Shur, A. M., 2017, Developments in Language Theory - 21st International Conference, DLT 2017, Proceedings. Springer Verlag, Vol. 10396 LNCS. p. 296-307 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10396 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  11. 2016

  12. Avoiding Letter Patterns in Ternary Square-Free Words

    Petrova, E. A., 5 Feb 2016, In: Electronic Journal of Combinatorics. 23, 1, 12 p., #P1.18.

    Research output: Contribution to journal › Article › peer-review

  13. 2015

  14. On the Tree of Ternary Square-Free Words

    Petrova, E. A. & Shur, A. M., 2015, COMBINATORICS ON WORDS, WORDS 2015. Manea, F. & Nowotka, D. (eds.). Springer Verlag, Vol. 9304. p. 223-236 14 p. (Lecture Notes in Computer Science; vol. 9304).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  15. 2012

  16. Constructing premaximal binary cube-free words of any level

    Petrova, E. A. & Shur, A. M., Dec 2012, In: International Journal of Foundations of Computer Science. 23, 8, p. 1595-1609 15 p.

    Research output: Contribution to journal › Article › peer-review

  17. Constructing premaximal ternary square-free words of any level

    Petrova, E. A. & Shur, A. M., 2012, Mathematical Foundations of Computer Science 2012 - 37th International Symposium, MFCS 2012, Proceedings. Vol. 7464 LNCS. p. 752-763 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7464 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Previous 1 2 Next

ID: 111379