Skip to main content
SpringerLink
Log in

Equidivisible kleene monoids and the Elgot-Mezei theorem

  • Research Article
  • Published:
Semigroup Forum Aims and scope Submit manuscript

Abstract

Equidivisible Kleene monoids satisfy the Elgot-Mezei theorem.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Amar, V. and G. Putzolu,Generalizations of Regular Events, Information and Control 8 (1965), 56–63.

    Article  MathSciNet  MATH  Google Scholar 

  2. Berstel, J.,Transductions and Context-Free Languages, Stuttgart: 1979.

  3. Clifford, A. H. and G. B. Preston,The Algebraic Theory of Semigroups, Volume 1, Providence: 1961.

  4. Eilenberg, S.,Automata,Languages,and Machines, Volume A, New York: 1974, 256–257.

  5. Elgot, C. C. and J. E. Mezei,On Relations Defined by Generalized Finite Automata, IBM Journal of Research and Development 9 (1965), 47–68.

    Article  MATH  MathSciNet  Google Scholar 

  6. Johnson, J. H.Do Rational Equivalence Relations Have Rational Cross-Sections?, ICALP 85, LNCS 194, Berlin: 1985, 300–309.

  7. Kleene, S. C.,Representations of Events in Nerve Nets and Finite Automata inAutomata Studies, C. E. Shannon and J. McCarthy (ed.), Princeton: 1956, 3–41.

  8. Lallement, G.,Semigroups and Combinatorial Applications New York: 1979.

  9. McKnight Jr., J. D.Kleene Quotient Theorems, Pacific Journal of Mathematics 14 (1964), 1343–1352.

    MATH  MathSciNet  Google Scholar 

  10. McKnight Jr., J. D. and A. J. Storey,Equidivisible Semigroups, Journal of Algebra 12 (1969), 24–48.

    Article  MATH  MathSciNet  Google Scholar 

  11. Reutenauer, C.:Sur les Semi-Groupes Vérifiant le Théorème de Kleene, RAIRO Informatique Théorique, 19 (1985), 281–291.

    MATH  MathSciNet  Google Scholar 

  12. Rupert, C. P.,Certain Rational Sets in Formal Language Theory, dissertation, The Pennsylvania State University: 1988.

  13. Sakarovitch, J.,Easy Multiplications I:The Realm of Kleene’s Theorem, Information and Computation 74 (1987), 173–197.

    Article  MATH  MathSciNet  Google Scholar 

  14. Sakarovitch, J.,On Regular Trace Languages, Theoretical Computer Science 52 (1987), 59–75.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. 3505 Gillon, 75205, Dallas, TX

    C. P. Rupert

Authors
  1. C. P. Rupert
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by G. Lallement

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rupert, C.P. Equidivisible kleene monoids and the Elgot-Mezei theorem. Semigroup Forum 40, 129–141 (1990). https://doi.org/10.1007/BF02573261

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02573261

Keywords

Search

Navigation