Classes with Pairwise Equivalent Enumerations

Sergei S. Goncharov, S. A. Badaev. Classes with Pairwise Equivalent Enumerations. In Anil Nerode, Yuri Matiyasevich, editors, Logical Foundations of Computer Science, Third International Symposium, LFCS 94, St. Petersburg, Russia, July 11-14, 1994, Proceedings. Volume 813 of Lecture Notes in Computer Science, pages 140-141, Springer, 1994.

@inproceedings{GoncharovB94,
  title = {Classes with Pairwise Equivalent Enumerations},
  author = {Sergei S. Goncharov and S. A. Badaev},
  year = {1994},
  researchr = {https://researchr.org/publication/GoncharovB94},
  cites = {0},
  citedby = {0},
  pages = {140-141},
  booktitle = {Logical Foundations of Computer Science, Third International Symposium, LFCS 94, St. Petersburg, Russia, July 11-14, 1994, Proceedings},
  editor = {Anil Nerode and Yuri Matiyasevich},
  volume = {813},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-58140-5},
}