Comparing Descriptional and Computational Complexity of Infinite Words

Juraj Hromkovic, Juhani Karhumäki, Arto Lepistö. Comparing Descriptional and Computational Complexity of Infinite Words. In Juhani Karhumäki, Hermann A. Maurer, Grzegorz Rozenberg, editors, Results and Trends in Theoretical Computer Science, Colloquium in Honor of Arto Salomaa, Graz, Austria, June 10-11, 1994, Proceedings. Volume 812 of Lecture Notes in Computer Science, pages 169-182, Springer, 1994.

@inproceedings{HromkovicKL94,
  title = {Comparing Descriptional and Computational Complexity of Infinite Words},
  author = {Juraj Hromkovic and Juhani Karhumäki and Arto Lepistö},
  year = {1994},
  researchr = {https://researchr.org/publication/HromkovicKL94},
  cites = {0},
  citedby = {0},
  pages = {169-182},
  booktitle = {Results and Trends in Theoretical Computer Science, Colloquium in Honor of Arto Salomaa, Graz, Austria, June 10-11, 1994, Proceedings},
  editor = {Juhani Karhumäki and Hermann A. Maurer and Grzegorz Rozenberg},
  volume = {812},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-58131-6},
}