Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Juraj Hromkovic, Juhani Karhumäki. Two Lower Bounds on Computational Complexity of Infinite Word Generation. In IFIP Congress (1). pages 479-484, 1994.
Abstract is missing.