Skip to main content
SpringerLink
Log in

Some algorithms on the star operation applied to finite languages

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

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

References

  1. Almeida, J.,Some algorithms related to the star operation applied to finite and rational languages, Ph.D. Thesis, The Pennsylvania State University (1982).

  2. Almeida, J.,Overlapping of words in rational languages, to appear.

  3. Berstel, J., D. Perrin, J.F. Perrot and A. Restivo,Sur le théorème du défaut, J. of Algebra 60.1 (1979), 169–180.

    Article  MathSciNet  Google Scholar 

  4. Blum, E.K.,Free subsemigroups of free semigroups, Mich. Math. J. 12(1965), 179–182.

    Article  MATH  MathSciNet  Google Scholar 

  5. Lallement, G.,Semigroups and Combinatorial Applications, Wiley, New York (1979).

    MATH  Google Scholar 

  6. Markov, A.A.,Alphabet coding, Soviet Math. 132(1960), 596–598.

    Google Scholar 

  7. —,Alphabet coding II, Soviet Phys.-Doklady 6 (1961), 553–554.

    MATH  Google Scholar 

  8. —,Non-recurrent coding, Problemy Kiberneticki 8 (1962), 169–186 (Russian).

    Google Scholar 

  9. —,On finitely generated subsemigroups of a free semigroup, Semigroup Forum 3 (1971), 251–258.

    Article  MATH  MathSciNet  Google Scholar 

  10. Riley, T.A.,The Sardinas/Patterson and Levenshtein Theorems, Information and Control 10(1967), 120–136.

    Article  MATH  MathSciNet  Google Scholar 

  11. Sardinas, A.A. and C.W. Patterson,A necessary and sufficient condition for unique decomposition of coded messages, Convention Records of the I.R.E. 8(1953), 104–108.

    Google Scholar 

  12. Schützenberger, M.P.,Une théorie algébrique du codage, C.R. Acad. Sci. Paris 242(1956), 862–864; Séminaire Dubreil-Pisot 1955–1956, No. 15.

    MathSciNet  Google Scholar 

  13. Spehner, T.C.,Quelques constructions et algorithmes relatifs aux sous-monoïdes d’un monoïde libre, Semigroup Forum 9(1975), 334–353.

    Article  MathSciNet  Google Scholar 

  14. Spehner, T.C., Quelques problèmes d’extension, de conjugaison et de présentation des sous-monoides d’un monoide libre, Doctoral Thesis, University of Paris (1976).

  15. —, Présentations of présentations simplifiables d’un monoïde simplifiable, Semigroup Forum 14 (1977), 295–329.

    Article  MATH  MathSciNet  Google Scholar 

  16. Tilson, D.,The intersection of free submonoids of a free monoid is free, Semigroup Forum 4 (1972), 345–350.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, The Pennsylvania State University, 16802, University Park, PA, USA

    Jorge Almeida

  2. Department of Mathematics, Simon Fraser University, Burnaby, B.C., Canada

    Jorge Almeida

Authors
  1. Jorge Almeida
    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

Almeida, J. Some algorithms on the star operation applied to finite languages. Semigroup Forum 28, 187–197 (1984). https://doi.org/10.1007/BF02572484

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

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

Keywords

Search

Navigation