Skip to main content
SpringerLink
Log in

Sur Le Produit De Concatenation Non Ambigu

  • 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. Brzozowski J.A., Culik II, K. and Gabriellian A, Classification of non counting events, J. of Computer and System Sci, 5 (1971) 41–53.

    Article  MathSciNet  Google Scholar 

  2. Brzozowski J., Run languages à paraître dans Discrete Maths.

  3. Césari Y., Sur un algorithme donnant les codes bipréfixes finis, Math. Syst. Theory 6 (1972) 221–223.

    Article  Google Scholar 

  4. Clifford A.H. and G.B. Preston, The algebraic theory of semigroups, Amer. Math. Soc., Providence, R.I., Vol I, 1961.

    MATH  Google Scholar 

  5. Eilenberg S., Automata, languages and machines, Vol B, Academic Press, New York and London, 1976.

    MATH  Google Scholar 

  6. Lallement G., Regular semigroups with D=R as syntactic monoids of finite prefix codes, à paraître dans Theoretical Computer Science.

  7. Lallement G. and E. Milito, Recognizable languages and finite semilattices of groups, Semigroup Forum, 11 (1975), 181–184.

    Article  MathSciNet  Google Scholar 

  8. Nc Naughton R. and S. Pappert., Counter free automata. MIT Press (1971).

  9. Perrin D., Codes bipréfixes et groupes de permutations. Thèse Paris (1975).

  10. Petrich M., The maximal semilattice decomposition of semigroups. Math. Zeit. 85 (1964) 68–82.

    Article  MathSciNet  Google Scholar 

  11. Rhodes J.L., Algebraic theory of finite semigroups, in Semigroups, K.W. Folley Ed., Academic Press, 1969.

  12. Rhodes J.L. and B.R. Tilson, Local Structure theorems for finite semigroups, in Algebraic theory of machines, languages, and semigroups, M.A. Arbib Ed., Academic Press, 1968.

  13. Rhodes J.L. and D. Allen Jr., Synthesis of the classical and modern theory of finite semigroups, Advances in Math. 11 (1973), 238–266.

    Article  Google Scholar 

  14. Simon I., Piecewise testable events, Second Conf. on Automata Theory, Kaiserslautern, 1975, à paraître dans Lecture Notes in Computer Science (Springer Verlag).

  15. Tamura T. and N. Kimura, Existence of greatest decomposition of semigroups, Kodai Math. Sem. Rep. 7 (1955) 83–84.

    MathSciNet  MATH  Google Scholar 

  16. Tilson B., Decomposition and complexity of finite semigroups, Semigroup Forum, 3 (1971), 189–250.

    Article  MathSciNet  Google Scholar 

  17. Tilson B., Depth decomposition theorems, Chapter XI in Reference 5.

  18. Tilson B., Complexity of two J-classes semigroups, Advances in Math 11 (1973), 215–237.

    Article  Google Scholar 

  19. Tilson B., On the p-length of p-solvable semigroups, in Semigroups, K.W. Folley Ed., Academic Press, 1969.

  20. Yamada M., On the greatest semilattice decomposition of semigroups. Kodai. Math. Sem. Rep. 7 (1955), 59–62.

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. U.E.R. de Mathématiques, Université de Paris VII, Tour 45-55, 5e Etage 2, place Jussieu, 75005, Paris

    M. P. Schützenberger

Authors
  1. M. P. Schützenberger
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communiqué par G. Lallement

Rights and permissions

Reprints and permissions

About this article

Cite this article

Schützenberger, M.P. Sur Le Produit De Concatenation Non Ambigu. Semigroup Forum 13, 47–75 (1976). https://doi.org/10.1007/BF02194921

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

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

Search

Navigation