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.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.