Skip to main content
SpringerLink
Log in

On the theory of syntactic monoids for rational languages

  • Section A Algebraic & Constructive Theory of Machines, Computations and Languages
  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1977)

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

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. BOË, J.-M.: Représentations des monoides, application à la théorie des codes, Thèse 3ème Cycle, Montpellier 1976.

    Google Scholar 

  2. BOË, J.-M., J. BOYAT, Y. CESARI, A. LACHENY et M. VINCENT: Automates et monoides syntaxiques des sous-monoides libres, to appear in Information and Control.

    Google Scholar 

  3. BRZOZOWSKI, J.A.: Hierarchies of aperiodic languages, RAIRO-Informatique Théorique 10 (1976) p.33–49.

    Google Scholar 

  4. BRZOZOWSKI, J.A., & R. KNAST: The dot-depth hierarchy of starfree events is infinite, Research Report CS-76-23, University of Waterloo, Canada (1976).

    Google Scholar 

  5. CLIFFORD, A.H., & G.B. PRESTON: The Algebraic Theory of Semigroups American Math. Soc., Vol. 1: 1961, Vol. 2: 1967.

    Google Scholar 

  6. EILENBERG, S.: Automata, languages and machines, Academic Press Vol. A: 1974, Vol. B: 1976.

    Google Scholar 

  7. EILENBERG, S., & M.P. SCHÜTZENBERGER: On Pseudovarieties, Advances in Math. 19 (1976) p. 413–418.

    Google Scholar 

  8. HASHIGUCHI, K., & N. HONDA: Properties of Code events and homomor=phisms over Regular events, J. Comp. Syst. Sci. 12 (1976) 352–367.

    Google Scholar 

  9. KEENAN, M., & G. LALLEMENT: On certain codes admitting inverse Semigroups as Syntactic monoids, Semigroup Forum 8 (1974) 312–331.

    Google Scholar 

  10. KNAST, R.: Semigroup characterizations of dot-depth one languages to appear in RAIRO-Informatique Théorique.

    Google Scholar 

  11. LALLEMENT, G., & E. MILITO: Recognizable languages and finite semilattices of groups, Semigroup Forum 11 (1975) 181–184.

    Google Scholar 

  12. PERRIN, D.: La transitivité du groupe d'un code bipréfixe fini, Math. Zeitschrift 153 (1977) 283–287.

    Google Scholar 

  13. PERRIN, D.: Le langage engendré par un code préfixe et son monoïde syntaxique, Thèse 3ème Cycle, Paris 1970.

    Google Scholar 

  14. PERRIN, D., & M.P. SCHÜTZENBERGER: Codes et sous-monoides possédant des mots neutres, in Theoretical Computer Science, 3rd GI Conference, Lecture Notes in Computer Science 48 (1977) 270–281.

    Google Scholar 

  15. PERROT, J.-F.: Groupes de permutations associés aux codes préfixes finis, in Permutations, Actes d'un Colloque réunis par A. Lentin, Gauthier-Villars/Mouton, 1974, p. 1974.

    Google Scholar 

  16. PERROT, J-F.: Informatique et Algèbre, la théorie des codes à longueur variable, in Theoretical Computer Science, 3rd GI Conference, Lecture Notes in Computer Science 48 (1977) p. 27–44.

    Google Scholar 

  17. PERROT, J-F., & J. SAKAROVITCH: A Theory of Syntactic Monoids for Context-free Languages, in Proceedings, IFIP Congress '77.

    Google Scholar 

  18. RESTIVO, A.: Codes and aperiodic languages, in 1. Fachtagung über Automatentheorie u. formale Sprachen, Lect. Notes in Comp. Science 2 (1973) p. 175–181.

    Google Scholar 

  19. RESTIVO, A.: On a question of McNaughton and Papert, Information and Control 25 (1974) 93–101.

    Google Scholar 

  20. RESTIVO, A.: A combinatorial property of codes having finite synchronization delay, Theoretical Computer Science 1 (1975) 95–101.

    Google Scholar 

  21. SCHÜTZENBERGER, M.P.: Une théorie algébrique du codage, Séminaire Dubreil-Pisot, 1955/56, Exp. no 15 (Institut H. Poincaré, Paris)

    Google Scholar 

  22. SCHÜTZENBERGER, M.P.: Sur certaines variétés de monoides finis, in Automata Theory, E.R. Caianiello, Ed., Academic Press 1966, p. 314–319.

    Google Scholar 

  23. SCHÜTZENBERGER, M.P.: Sur certaines pseudo-variétés de monoides finis, IRIA-Laboria, Rapport de Recherche no 62, 1974.

    Google Scholar 

  24. SCHÜTZENBERGER, M.P.: Sur les monoides finis dont les groupes sont commutatifs, RAIRO R-1, 1974, p. 55–61.

    Google Scholar 

  25. SCHÜTZENBERGER, M.P.: Sur certaines propriétés de fermeture dans les langages rationnels, Symposia Mathematica (Roma) XV (1975) p. 245–253.

    Google Scholar 

  26. SCHÜTZENBERGER, M.P.: Sur le produit de concaténation non ambigu, Semigroup Forum 13 (1976) 47–75.

    Google Scholar 

  27. SCHÜTZENBERGER, M.P.: Une propriété des sous-monoides finiment engendrés d'un monoide libre, to appear.

    Google Scholar 

  28. SIMON, I.: Piecewise testable events, in Automata Theory and Formal Languages, 2nd GI Conference, Lecture Notes in Computer Science 33 (1975), p.214–222.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Paris

    J -F. Perrot

Authors
  1. J -F. Perrot
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Marek Karpiński

Rights and permissions

Reprints and permissions

Copyright information

© 1977 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Perrot, J.F. (1977). On the theory of syntactic monoids for rational languages. In: Karpiński, M. (eds) Fundamentals of Computation Theory. FCT 1977. Lecture Notes in Computer Science, vol 56. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08442-8_81

Download citation

  • DOI: https://doi.org/10.1007/3-540-08442-8_81

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08442-6

  • Online ISBN: 978-3-540-37084-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation