On languages generated by semigroups
In this paper we investigate properties of classes of languages generated by semigroups in the following sense:
We investigate the languages generated in this sense by certain types of semigroups. It is important to emphasize that we do not consider the empty word, thus all languages are subsets of free semigroups of the form A+, similarly all homomorphisms we investigate are semigroup homomorphisms only. Since the proofs of our results are based on rather complicated semigroup constructions we sketch them out or omit at all. The detailed proofs are to be presented in .
Unable to display preview. Download preview PDF.
- 1.J.E. Pin. Varietés de langages et monoide des parties. Semigroup forum Vol 20 /1980/Google Scholar
- 2.H.Straubing. Recognizable sets and power sets of finite semigroups. Semigroup forum vol 18 /1979/Google Scholar
- 3.M.P. Chytil and P. Jančar Personal communications.Google Scholar
- 4.P. Jančar. Characterization of context-free languages by free groups. Master thesis, Charles University, Prague 1982.Google Scholar
- 5.G. Lallement. Semigroups and combinatorial applications. John Wiley and sons, N.Y. 1979.Google Scholar
- 6.S. Eilenberg and M.P. Schützenberger. On pseudovarieties of monoids, Adv. Math. 19/1979/413–448Google Scholar
- 7.J.E. Hopcroft and J.D. Ullman. Formal languages and their relations to automata. Addison-Wesley 1969.Google Scholar
- 8.R.C. Lyndon and P.E. Schupp. Combinatorial group theory, Springer Verlag 1977.Google Scholar
- 9.S. Eilenberg. Automata, languages and machines, Vol B, Ac. Press N.Y. 1976.Google Scholar
- 10.L. Janiga and Václav Koubek. On languages generated by semigroups and groups — in preparation.Google Scholar