The Alternation Hierarchy for Machines with Sublogarithmic Space is Infinite

Burchard von Braunmühl, Romain Gengler, Robert Rettinger. The Alternation Hierarchy for Machines with Sublogarithmic Space is Infinite. In Patrice Enjalbert, Ernst W. Mayr, Klaus W. Wagner, editors, STACS 94, 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, February 24-26, 1994, Proceedings. Volume 775 of Lecture Notes in Computer Science, pages 85-96, Springer, 1994.

@inproceedings{BraunmuhlGR94,
  title = {The Alternation Hierarchy for Machines with Sublogarithmic Space is Infinite},
  author = {Burchard von Braunmühl and Romain Gengler and Robert Rettinger},
  year = {1994},
  researchr = {https://researchr.org/publication/BraunmuhlGR94},
  cites = {0},
  citedby = {0},
  pages = {85-96},
  booktitle = {STACS 94, 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, February 24-26, 1994, Proceedings},
  editor = {Patrice Enjalbert and Ernst W. Mayr and Klaus W. Wagner},
  volume = {775},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-57785-8},
}