Abstract
The most of the previous work on the complexity of infinite words has measured the complexity as descriptional one, i. e. an infinite word w had a “small” complexity if it was generated by a morphism or another simple machinery, and w has been considered to be “complex” if one needs to use more complex devices (gsm's) to generate it. In [5] the study of the computational complexity of infinite word generation and of its relation to the descriptional characterizations mentioned above was started. The complexity classes GSPACE(f) = {infinite words generated in space f(n)} are defined there, and some fundamental mechanisms for infinite word generation are related to them. It is also proved there, that there is no hierarchy between GSPACE(O(1)) and GSPACE(log2 n). Here, GSPACE(f) ⊂ GSPACE(g) for g(n)≥f(n)≥log2 n, f(n)=o(g(n)) is proved. The main result of this paper is a new lower bound on the computational complexity of infinite word generation: real-time, binary working alphabet, and o(n/(log n)2 space is insufficient to generate a concrete infinite word over two-letter alphabet.
This author was partially supported by the Slovak Scientific Grant Agency Grant No. 95/5305/277.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. M. Autebert, J. Gabarró: Iterated GSM's and Co-CFL. Acta Informatica 26(1989), 749–769.
K. Culik II, and J. Karhumäki: Iterative devices generating infinite words. In: Lecture Notes in Computer Science 577, Springer-Verlag 1992. (also Int. J. Found. Comput. Sci. 5 (1994), 69–97).
G. J. Chaitin: On the length of programs for computing finite binary sequences: statistical considerations. J. Assoc. Comp. Mach. 16 (1969), 145–159.
P. C. Fischer, A. Meyer, and A. Rosenberg: Time restricted sequence generation. J. Comp. Syst. Sci. 4 (1970), 50–73.
J. Hromkovič, J. Karkumäki, A. Lepistö: Computational complexity of infinite word generation. In: “Results and Trends in Theoretical Computer Science” (H. Maurer, ed.), Lecture Notes in Computer Science 812, Springer Verlag 1994, 169–182.
J. E. Hopcroft, J. D. Ullman: Introduction to Automata Theory, Languages and Computation. Addison-Wesley Publishing Company, Inc. 1979.
A. N. Kolmogorov: Three approaches to the quantitative definition of information. Problems Inform. Transmission 1(1968), 662–664.
M. Li, P. M. B. Vitányi: Kolmogorov complexity and its applications. In: Handbook of Theoretical Computer Science A — Algorithms and Complexity (Jan van Leeuwen, ed.), Elsevier, Amsterdam, New York-Oxford-Tokyo & The MIT Press, Cambridge 1990, 187–254.
M. Li, P. M. B. Vitányi: An Introduction to Kolmogorov Complexity and its Applications. Springer-Verlag, Berlin, 1993.
A. Lepistö: On the computational complexity of infinite words. In: Developments in Language Theory II (J. Dassow, G. Rozenberg, and A. Salomaa, eds.), World-Scientific, Singapore, 1996, 350–359.
M. Lothaire: Combinatorics on Words. Addison-Wesley, Reading, Massachusetts 1981.
A. Salomaa: Jewels of Formal Language Theory. Computer Science Press, Rockville, Maryland 1981.
R. J. Solomonoff: A formal theory of inductive inference. Part 1 and Part 2. Inform. and Control 7(1964), 1–22 and 224–254.
A. Thue: Über unendliche Zeichenreihen. Norske Vid. Selsk. Skr., I Mat. Nat. KI., Kristiania 7 (1906), 1–22.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Hromkovič, J., Karhumäki, J. (1997). Two lower bounds on computational complexity of infinite words. In: Păun, G., Salomaa, A. (eds) New Trends in Formal Languages. Lecture Notes in Computer Science, vol 1218. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62844-4_26
Download citation
DOI: https://doi.org/10.1007/3-540-62844-4_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62844-6
Online ISBN: 978-3-540-68703-0
eBook Packages: Springer Book Archive