Where academic tradition
meets the exciting future

Comparing descriptive and computational complexity of infinite words

Juraj Hromkovic, Juhani Karhumäki, Arto Lepistö, Comparing descriptive and computational complexity of infinite words. Lecture Notes in Computer Science 812, 169–182, 1994.

BibTeX entry:

@ARTICLE{jHroKaLe94,
  title = {Comparing descriptive and computational complexity of infinite words},
  author = {Hromkovic, Juraj and Karhumäki, Juhani and Lepistö, Arto},
  journal = {Lecture Notes in Computer Science},
  volume = {812},
  pages = {169–182},
  year = {1994},
}

Publication Forum rating of this publication: level 1

Edit publication