21 - 24 out of 24Page size: 10
  1. 2003

  2. An inverse automata algorithm for recognizing 2-collapsing words

    Ananichev, D. S., Volkov, M. V. & Cherubini, A., 1 Jan 2003, Developments in Language Theory - 6th International Conference, DLT 2002, Revised Papers. Springer Verlag, p. 270-282 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2450).

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

  3. 2002

  4. Collapsingwords vs. synchronizingwords

    Ananichev, D. S. & Volkov, M. V., 1 Dec 2002, Developments in Language Theory - 5th International Conference, DLT 2001, Revised Papers. p. 166-174 9 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2295 LNCS).

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

  5. 1998

  6. Varieties of solvable lie rings of finite width

    Ananichev, D. S. & Volkov, M. V., 1 Jan 1998, In: Mathematical Notes. 63, 5-6, p. 569-574 6 p.

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

  7. 1995

  8. Almost distributive varieties of Lie rings

    Ananichev, D. S., 30 Apr 1995, In: Sbornik: Mathematics. 186, 4, p. 465-483 19 p.

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

Previous 1 2 3 Next

ID: 61695