You are here: TUCS > PUBLICATIONS > Publication Search > On the Computational Complexit...
- 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. TUCS Technical Reports 423, Turku Centre for Computer Science, 2001.
Abstract:
http://www.tucs.fi/Publications/techreports/TR423.php
Files:
Full publication in PDF-format
BibTeX entry:
@TECHREPORT{tDuMa01a,
title = {On the Computational Complexity of Infinite Words},
author = {Duris, Pavol and Manuch, Ján},
number = {423},
series = {TUCS Technical Reports},
publisher = {Turku Centre for Computer Science},
year = {2001},
}