81 - 90 out of 105Page size: 10
  1. 2004

  2. A reducibility for the dot-depth hierarchy

    Selivanov, V. L. & Wagner, K. W., 1 Jan 2004, Mathematical Foundations of Computer Science 2004 (MFCS 2004). p. 783-793 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 3153).

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

  3. Boolean hierarchies of partitions over a reducible base

    Selivanov, V. L., 1 Jan 2004, In: Algebra and Logic. 43, 1, p. 44-61 18 p.

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

  4. 2003

  5. Wadge degrees of ω-languages of deterministic turing machines

    Selivanov, V., 1 Jan 2003, STACS 2003 (STACS 2003). p. 97-108 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2607).

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

  6. Wadge degrees of ω-languages of deterministic turing machines

    Selivanov, V., 1 Jan 2003, In: RAIRO - Theoretical Informatics and Applications. 37, 1, p. 67-83 17 p.

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

  7. 2002

  8. Decidability of hierarchies of regular aperiodic languages

    Selivanov, V. L., 1 Jan 2002, In: Algebra and Logic. 41, 5, p. 337-348 12 p.

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

  9. Relating automata-theoretic hierarchies to complexity-theoretic hierarchies

    Selivanov, V. L., 1 Jan 2002, In: RAIRO - Theoretical Informatics and Applications. 36, 1, p. 29-42 14 p.

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

  10. 1999

  11. Refining the polynomial hierarchy

    Selivanov, V. L., 1 Jan 1999, In: Algebra and Logic. 38, 4, p. 248-258 11 p.

    Research output: Contribution to journal › Review article › peer-review

  12. 1998

  13. Fine hierarchy of regular ω-languages

    Selivanov, V., 30 Jan 1998, In: Theoretical Computer Science. 191, 1-2, p. 37-59 23 p.

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

  14. 1996

  15. On recursively enumerable structures

    Selivanov, V., 4 Apr 1996, In: Annals of Pure and Applied Logic. 78, 1-3, p. 243-258 16 p.

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

  16. 1995

  17. Fine hierarchy of regular ω-languages

    Selivanov, V., 1 Jan 1995, TAPSOFT '95: Theory and Practice of Software Development (CAAP 1995). p. 277-287 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 915).

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

Previous 1...5 6 7 8 9 10 11 Next

ID: 42363115