Searching for "On the Computational Complexity of Infinite Words." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

On the Computational Complexity of Infinite Words
by Pavol Duris, Jan Manuch, Turku Centre, Computer Science — 2001
…On the Computational Complexity of Innite Words Research supported by DAAD and Academy of Finland…
Add To MetaCart

Two Lower Bounds on Computational Complexity of Infinite Words
by Juraj Hromkovic, Juhani Karhumäki — 1996 — trends in formal languages, LNCS 1218
…Two Lower Bounds on Computational Complexity of Infinite Words Juraj Hromkovic + Institute…
Cited by 1 (0 self) – Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB