71 - 76 out of 76Page size: 10
  1. 2008

  2. Comparing complexity functions of a language and its extendable part

    Shur, A. M., 2008, In: RAIRO - Theoretical Informatics and Applications. 42, 3, p. 647-655 9 p.

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

  3. 2007

  4. Rational approximations of polynomial factorial languages

    Shur, A. M., Jun 2007, In: International Journal of Foundations of Computer Science. 18, 3, p. 655-665 11 p.

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

  5. 2006

  6. Factorial languages of low combinatorial complexity: book chapter

    Shur, A. M., 2006, Developments in Language Theory - 10th International Conference, DLT 2006, Proceedings: book. Springer Verlag, p. 397-407 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4036 LNCS).

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

  7. 2001

  8. On the periods of partial words

    Shur, A. M. & Konovalova, Y. V., 2001, Mathematical Foundations of Computer Science 2001 - 26th International Symposium, MFCS 2001, Proceedings. Sgall, J., Pultr, A. & Kolman, P. (eds.). Springer Verlag, p. 657-665 9 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2136).

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

  9. 1996

  10. Overlap-free words and Thue-Morse sequences

    Shur, A. M., Jun 1996, In: International Journal of Algebra and Computation. 6, 3, p. 353-367 15 p.

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

  11. Binary avoidability and thue-morse words

    Shur, A. M., May 1996, In: Doklady Mathematics. 53, 3, p. 405-406 2 p.

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

Previous 1...4 5 6 7 8 Next

ID: 61788