Abstract
We investigate description of languages recognized by a semigroup S in terms of Green relations on S and groups contained in S. This technique allows us to characterize varieties of languages corresponding to unions of groups and local groups.
Similar content being viewed by others
References
Brzozowski, J.A., Culik, K., and Gabrielian, A.Classification of noncounting events, J. Comp. Syst. Sci. 5, 1971, 41–53.
Eilenberg, S.,Automata, Languages and Machines, Vol. B, Academic Press, New-York, 1976.
Lallement, G.,Semigroups and Combinatorial Applications, Wiley Interscience, 1979.
Rhodes, J.L., and Tilson, B.R.,Local Structure theorems for finite semigroups, in Algebraic theory of machines, languages and semigroups, M.A. Arbib, Ed., Academic Press, New-York, 1968.
Straubing, H.,Families of recognizable sets corresponding to certain varieties of finite monoids, J. Pure Appl. Alg. 15, 1979, 305–318.
Straubing, H.,Recognizable sets whose syntactic monoids contain solvable groups, Ph.D. Thesis, Berkeley, 1978.
Thérien, D.Sur les monoides dont tous les groupes sont résolubles, Semigroup Forum (to appear).
Author information
Authors and Affiliations
Additional information
Communicated by G. Lallement
Dedicated to E.S. Lyapin on his 70th Birthday
Rights and permissions
About this article
Cite this article
Thérien, D. A language theoretic interpretation of the schutzenberger representations with applications to certain varieties of languages. Semigroup Forum 28, 235–248 (1984). https://doi.org/10.1007/BF02572486
Received:
Revised:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF02572486