Abstract
Explicit representations of the ω-words that are fixed (resp., stationary) relative to a function h: A -→ A* are given. A procedure is provided for constructing a concise expression for the fixed (resp., stationary) ω -language of such an h. The equivalence problem for fixed (resp., stationary) ω-languages of functions h & k: A -→ A* is shown to be decidable. The fundamental tool for this latter procedure is the recently developed algorithm of K. Culik II & T. Harju for deciding the ω -sequence equivalence problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
K. Culik II and T. Harju, The ω-sequence equivalence problem for DOL systems is decidable, J. Assoc. Computing Machinerjy 31 (1984)282–298.
K. Culik II and A. Salomaa, On infinite words obtained by iterating morphisms, Theoret. Cumput. Sci. 19 (1982)29–38.
J. Englefriet and G. Rozenberg, Equality languages and fixed point languages, Information and Control 43 (1979)20–49.
J. J. Grefenstette, Stability in L systems, Theoret. Comput. Sci. 24 (1983)53–71.
T. Harju and M. Linna, On the periodicity of morphisms on free monoids, RAIRO Informatique Théorique (to appear).
T. Head, Expanded subalphabets in the theories of languages and semigroups, Intern. J. Comput. Math. 12 (1982)113–123.
T. Head, G. Thierrin, and J. Wilkinson, DOL schemes and the periodicity of string embeddings, Theoret. Comput. Sci. 23 (1983)83–89.
T. Head, Adhérences of DOL languages, Theoret. Comput. Sci. 31 (1984)139–149.
G.T. Herman and A. Walker, Context-free languages in biological systems, Internat. J. Comput. Math. 4 (1975)369–391.
J. van Leeuwen, On fixed points of monogenic functions in free monoids, Semigroup Forum 10 (1975)315–328.
J.J. Pansiot, Decidability of periodicity for infinite words, RAIRO Informatique Théorique (to appear).
A. Salomaa, Morphisms on free moniods and language theory, in: R.V. Book, ed., Formal Language Theory (Academic Press, New York, 1980).
A. Salomaa, Jewels of Formal Language Theory (Computer Science Press, Rockville, MD, 1917.
G. Thierrin, Context-free and stationary languages, Intern. J. Comput. Math. 7 (1979)297–301.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Head, T., Lando, B. (1986). Fixed and Stationary ω —Words and ω —Languages. In: The Book of L. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-95486-3_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-95486-3_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-95488-7
Online ISBN: 978-3-642-95486-3
eBook Packages: Springer Book Archive