Omega-Syntactic Congruences

An ω-language over a finite alphabet X is a set of infinite sequences of letters of X. Previously studied syntactic equivalence relations defined by ω-languages have mainly been relations on X∗. In this paper the emphasis is put on relations in Xω, by associating to an ω-language L a congruence on Xω, called the ω-syntactic congruence of L. Properties of this congruence and notions induced by it, such as ω-residue, ω-density, and separativeness are defined and investigated. Finally, a congruence on X ∗ related to the ω-syntactic congruence and quasi-orders on Xω induced by an ω-language are studied.

[1]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[2]  Ludwig Staiger,et al.  On Syntactic Congruences for Omega-Languages , 1993, Theor. Comput. Sci..

[3]  Thomas Wilke An Eilenberg Theorem for Infinity-Languages , 1991, ICALP.

[4]  Helmut Jürgensen,et al.  Disjunctive omega-Languages , 1983, J. Inf. Process. Cybern..

[5]  G Thierrin,et al.  Which monoids are syntactic monoids of Ω-Languages , 1986 .

[6]  Ludwig Staiger,et al.  On Syntactic Congruences for Omega-Languages , 1997, Theor. Comput. Sci..

[7]  André Arnold,et al.  A Syntactic Congruence for Rational omega-Language , 1985, Theor. Comput. Sci..

[8]  H. Shyr Free monoids and languages , 1979 .

[9]  A. Clifford,et al.  The algebraic theory of semigroups , 1964 .