• TUCS Publication Series
• How to Publish in TUCS Series
• Publication Search
• Publication Graph
• Publication Input
• Publication Input Guide
• JuFo Browser

On the Computational Complexity of Infinite Words

Pavol Duris, Ján Manuch, On the Computational Complexity of Infinite Words. In: MFCS 2001, 26th International Symposium, LNCS 2136, 328-337, Springer-Verlag, 2001.

Abstract:

http://www.tucs.fi/Publications/proceedings/purMaa.php

Files:

Full publication in PDF-format

BibTeX entry:

@INPROCEEDINGS{purMaa,
  title = {On the Computational Complexity of Infinite Words},
  booktitle = {MFCS 2001, 26th International Symposium},
  author = {Duris, Pavol and Manuch, Ján},
  series = {LNCS 2136},
  publisher = {Springer-Verlag},
  pages = {328-337},
  year = {2001},
}

Edit publication