Skip to main content
SpringerLink
Log in

On languages generated by semigroups

  • Conference paper
  • First Online:
Foundations of Computation Theory (FCT 1983)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 158))

Included in the following conference series:

  • 117 Accesses

Abstract

In this paper we investigate properties of classes of languages generated by semigroups in the following sense:

Let S be a semigroup, s its element, A an alphabet and f a mapping which assignes to each a ε A a finite subset f(a) of S. A word w=a1 ... an ε A+ belongs to the language generated by S, f, s and A iff the following condition holds:

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 [10].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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–448

    Google 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 

Download references

Author information

Authors and Affiliations

  1. Charles University, Malostranské náměstí 25, Praha 1, Czechoslovakia

    Ladislav Janiga & Václav Koubek

Authors
  1. Ladislav Janiga
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Václav Koubek
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Marek Karpinski

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Janiga, L., Koubek, V. (1983). On languages generated by semigroups. In: Karpinski, M. (eds) Foundations of Computation Theory. FCT 1983. Lecture Notes in Computer Science, vol 158. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12689-9_107

Download citation

  • DOI: https://doi.org/10.1007/3-540-12689-9_107

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12689-8

  • Online ISBN: 978-3-540-38682-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation