Some decision results for recognizable sets in arbitrary monoids

  • Antonio Restivo
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 62)


Finite Index Decision Result Finite Automaton Finite Union Free Monoid 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    -A.H. Clifford and G.B. Preston, "The Algebraic Theory of Semigroups", Vol.I, American Mathematical Society, Providence, 1964.Google Scholar
  2. [2]
    -S. Eilenberg, "Automata, Languages and Machines", Vol.A, Academic Press, New York, 1974.Google Scholar
  3. [3]
    -J.D. McKnight, Kleene Quotient Theorems, Pacific Journal Mathematics, 14 (1964), 1343–1352.Google Scholar
  4. [4]
    -I.Simon, Locally Finite Semigroups and Limited Subsets of a Free Monoid, Preprint Universidade de Sao paulo, February 1978.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1978

Authors and Affiliations

  • Antonio Restivo
    • 1
  1. 1.Istituto di Matematica dell'Università di Palermo and Laboratorio di Cibernetica del CNR di Arco FeliceItaly

Personalised recommendations