71 - 80 out of 105Page size: 10
  1. 2008

  2. On the difference hierarchy in countably based T0-spaces

    Selivanov, V., 1 Jan 2008, Proceedings of the 5th International Conference on Computability and Complexity in Analysis, CCA 2008. p. 257-269 13 p.

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

  3. 2007

  4. Definability in the homomorphic quasiorder of finite labeled forests

    Kudinov, O. V. & Selivanov, V. L., 1 Dec 2007, 3rd Conference on Computability in Europe, CiE 2007. p. 436-445 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4497).

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

  5. The quotient algebra of labeled forests modulo h-equivalence

    Selivanov, V. L., 1 Mar 2007, In: Algebra and Logic. 46, 2, p. 120-133 14 p.

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

  6. Fine hierarchy of regular aperiodic ω-languages

    Selivanov, V. L., 1 Jan 2007, Developments in Language Theory (DLT 2007). p. 399-410 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4588 ).

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

  7. Undecidability in the Homomorphic Quasiorder of Finite Labelled Forests

    Oleg, K. & Селиванов, В. Л., 2007, In: Journal of Logic and Computation. 17, p. 1135-1151

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

  8. 2006

  9. Towards a descriptive set theory for domain-like structures

    Selivanov, V. L., 12 Nov 2006, In: Theoretical Computer Science. 365, 3, p. 258-282 25 p.

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

  10. Undecidability in the homomorphic quasiorder of finite labeled forests

    Kudinov, O. V. & Selivanov, V. L., 1 Jan 2006, Logical Approaches to Computational Barriers (CiE 2006). p. 289-296 8 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 3988).

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

  11. 2005

  12. Classifying countable Boolean terms

    Selivanov, V. L., 1 Mar 2005, In: Algebra and Logic. 44, 2, p. 95-108 14 p.

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

  13. Variations on wadge reducibility extended abstract

    Selivanov, V. L., 3 Feb 2005, In: Electronic Notes in Theoretical Computer Science. 120, SPEC. ISS., p. 159-171 13 p.

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

  14. Some reducibilities on regular sets

    Selivanov, V. L., 1 Jan 2005, Some reducibilities on regular sets. Vol. 3526. p. 430-439 10 p. (Lecture Notes in Computer Science).

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

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

ID: 42363115