Abstract
The Myhill-Nerode Theorem (that for any regular language, there is a canonical recognizing device) is of paramount importance for the computational handling of many formalisms about finite words.
For infinite words, no prior concept of homomorphism or structural comparison seems to have generalized the Myhill-Nerode Theorem in the sense that the concept is both language preserving and in a natural correspondence to automata.
In this paper, we propose such a concept based on Families of Right Congruences [3], which we view as a recognizing structures.
We also establish an exponential lower and upper bound on the change in size when a representation is reduced to its canonical form.
The author was partially supported by a Fellowship from the Danish Research Council.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
B. Alpern and F.B. Schneider. Defining liveness. Information Processing Letters, 21:181–185, Oct. 1985.
A. Arnold. A syntactic congruence for rational ω-languages. Theoretical Computer Science, 39:333–335, 1985.
O. Maler and L. Staiger. On syntactic congruences for ω-languages. Technical Report 93-13, Aachener Informatik-Berichte, 1993. A preliminary version appeared in: Proc. STACS 93, LNCS 665, Springer-Verlag, Berlin 1993, pp. 586–594.
B. Le Sac. Saturating right congruences. Informatique Théorique et Applications, 24:545–560, 1990.
B. Le Sac, J.-E. Pin, and P. Weil. Semigroups with idempotent stabilizers and applications to automata theory. International Journal of Algebra and Computation, 1(3):291–314, 1991.
W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 133–191. MIT Press/Elsevier, 1990.
D. L. Van, B. Le Sac, and I. Litovsky. Characterizations of rational ω-languages by means of right congruences. Theoritical Computer science, ?(?), 1995. To appear.
T. Wilke. An Eilenberg theorem for ∞-languages. In Proc. 18th Inter. Coll. on Automata, Languages, and Programming, LNCS 510, pages 588–599. Springer Verlag, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Klarlund, N. (1995). A homomorphism concept for ω-regularity. In: Pacholski, L., Tiuryn, J. (eds) Computer Science Logic. CSL 1994. Lecture Notes in Computer Science, vol 933. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022276
Download citation
DOI: https://doi.org/10.1007/BFb0022276
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60017-6
Online ISBN: 978-3-540-49404-1
eBook Packages: Springer Book Archive