Skip to main content

Some decision results for recognizable sets in arbitrary monoids

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1978)

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

Included in the following conference series:

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. -A.H. Clifford and G.B. Preston, "The Algebraic Theory of Semigroups", Vol.I, American Mathematical Society, Providence, 1964.

    Google Scholar 

  2. -S. Eilenberg, "Automata, Languages and Machines", Vol.A, Academic Press, New York, 1974.

    Google Scholar 

  3. -J.D. McKnight, Kleene Quotient Theorems, Pacific Journal Mathematics, 14 (1964), 1343–1352.

    Google Scholar 

  4. -I.Simon, Locally Finite Semigroups and Limited Subsets of a Free Monoid, Preprint Universidade de Sao paulo, February 1978.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Giorgio Ausiello Corrado Böhm

Rights and permissions

Reprints and permissions

Copyright information

© 1978 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Restivo, A. (1978). Some decision results for recognizable sets in arbitrary monoids. In: Ausiello, G., Böhm, C. (eds) Automata, Languages and Programming. ICALP 1978. Lecture Notes in Computer Science, vol 62. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08860-1_27

Download citation

  • DOI: https://doi.org/10.1007/3-540-08860-1_27

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics