Skip to main content
SpringerLink
Log in

Syntactic Semigroups

  • Chapter
  • First Online:
Handbook of Formal Languages

Abstract

This chapter gives an overview on what is often called the algebraic theory of finite automata. It deals with languages, automata and semigroups, and has connections with model theory in logic, boolean circuits, symbolic dynamics and topology.

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. D. Albert, R. Baldinger and J. Rhodes, The identity problem for finite semi-groups, J. Symbolic Logic 57 1992, 179–192.

    MathSciNet  MATH  Google Scholar 

  2. J. Almeida, Equations for pseudovarieties, Formal properties of finite automata and applications J.-E. Pin (ed.) Lect. Notes in Comp. Sci. 386 Springer-Verlag, Berlin 1989, 148–164.

    Google Scholar 

  3. J. Almeida, Implicit operations on finite,7-trivial semigroups and a conjecture of I. Simon, J. Pure Appl. Algebra 69 1990, 205–218.

    MathSciNet  MATH  Google Scholar 

  4. J. Almeida, On pseudovarieties, varieties of languages, filters of congruences, pseudoidentities and related topics, Algebra Universalis 27 1990, 333–350.

    MathSciNet  MATH  Google Scholar 

  5. J. Almeida, Finite semigroups and universal algebra, Series in Algebra Vol 3, World Scientific, Singapore, 1994.

    MATH  Google Scholar 

  6. J. Almeida, A syntactical proof of the locality of DA, International Journal of Algebra and Computation, 6(2) 1996, 165–178.

    MathSciNet  MATH  Google Scholar 

  7. J. Almeida and P. Weil, Relatively free profinite monoids: an introduction and examplesin NATO Advanced Study Institute Semigroups, Formal Languages and Groups J. Fountain (ed.), Kluwer Academic Publishers, 1995, 73–117.

    Google Scholar 

  8. J. Almeida and P. Weil, Free profinite semigroups over semidirect products, with J. Almeida, Izvestiya VUZ Matematika 39 1995, 3–31. English version, Russian Mathem. (Iz. VUZ) 39 1995, 1–27.

    Google Scholar 

  9. J. Almeida and P. Weil, Reduced factorization in free profinite groups and join decompositions of pseudo-varieties, International Journal of Algebra and Computation 4 1994, 375–403.

    MathSciNet  MATH  Google Scholar 

  10. J. Almeida and P. Weil, Profinite categories and semidirect products, to appear.

    Google Scholar 

  11. M. Arfi, Polynomial operations and rational languages, 4th STACS, Lect. Notes in Comp. Sci . 247 Springer-Verlag, Berlin 1987, 198–206.

    Google Scholar 

  12. M. Arfi, Opérations polynomiales et hiérarchies de concaténation, Theor. Comput. Sci. 91 1991, 71–84.

    MathSciNet  MATH  Google Scholar 

  13. A. Arnold, A syntactic congruence for rational w-languages, Theor. Comput. Sci. 39 1985, 333–335.

    MathSciNet  MATH  Google Scholar 

  14. C. J. Ash, Finite semigroups with commuting idempotents, in J. Austral. Math. Soc. Ser. A 43 1987, 81–90.

    MathSciNet  MATH  Google Scholar 

  15. C. J. Ash, Inevitable sequences and a proof of the type II conjecture, in Proceedings of the Monash Conference on Semigroup Theory,World Scientific, Singapore 1991, 31–42.

    MATH  Google Scholar 

  16. C. J. Ash, Inevitable Graphs: A proof of the type II conjecture and some related decision procedures, Int. Jour. Alg. and Comp. 1 1991, 127–146.

    MathSciNet  Google Scholar 

  17. C. J. Ash, T. E. Hall and J. E. Pin, On the varieties of languages associated to some varieties of finite monoids with commuting idempotents, Information and Computation 86 1990, 32–42.

    MathSciNet  MATH  Google Scholar 

  18. Y. Bar-Hillel and E. Shamir, Finite-State Languages, Bull. Res. Council Israel. 8F 1960, 155–166.

    MATH  Google Scholar 

  19. J. Berstel, Transductions and context-free languages, Teubner, Stuttgart, 1979.

    MATH  Google Scholar 

  20. J. Berstel and D. Perrin, Theory of codes, Academic Press, London, 1985.

    MATH  Google Scholar 

  21. J. Berstel and J. Sakarovitch, Recent results in the theory of rational sets, Proceedings of MFCS’86,Lect. Notes in Comp. Sci . 233 Springer-Verlag Berlin 1986, 15–28.

    Google Scholar 

  22. G. Birkhoff, On the structure of abstract algebras, Proc. Cambridge Phil. Soc. 31 1935, 433–454.

    MATH  Google Scholar 

  23. P. Blanchard, Morphismes et comptages sur les langages rationnels, J. Inform. Process. Cybernet. 23 1987, 3–11.

    MathSciNet  MATH  Google Scholar 

  24. F. Blanchet-Sadri, Games, equations and the dot-depth hierarchy, Comput. Math. Appl. 18 1989, 809–822.

    MathSciNet  MATH  Google Scholar 

  25. F. Blanchet-Sadri, On dot-depth two, Informatique Théorique et Applications 24 1990, 521–530.

    MathSciNet  MATH  Google Scholar 

  26. F. Blanchet-Sadri, Games, equations and dot-depth two monoids, Discrete Appl. Math. 39 1992, 99–111.

    MathSciNet  MATH  Google Scholar 

  27. F. Blanchet-Sadri, The dot-depth of a generating class of aperiodic monoids is computable, International Journal of Foundations of Computer Science 3 1992, 419–442.

    MathSciNet  MATH  Google Scholar 

  28. F. Blanchet-Sadri, Equations and dot-depth one, Semigroup Forum 47 1993, 305–317.

    MathSciNet  MATH  Google Scholar 

  29. F. Blanchet-Sadri, On a complete set of generators for dot-depth two, Discrete Appl. Math. 50 1994, 1–25.

    MathSciNet  MATH  Google Scholar 

  30. F. Blanchet-Sadri, Equations and monoids varieties of dot-depth one and two, Theor. Comput. Sci. 123 1994, 239–258.

    MathSciNet  MATH  Google Scholar 

  31. F. Blanchet-Sadri, Equations on the semidirect product of a finite semilattice by a,ℐ-trivial monoid of height k, Informatique Théorique et Applications 29 1995, 157–170.

    MathSciNet  MATH  Google Scholar 

  32. F. Blanchet-Sadri, Some logical characterizations of the dot-depth hierarchy and applications, J. Comput. Syst. Sci. 51 1995, 324–337.

    MathSciNet  MATH  Google Scholar 

  33. S. L. Bloom, Varieties of ordered algebras, J. Comput. System Sci. 13 1976, 200–212.

    MathSciNet  MATH  Google Scholar 

  34. M. J. J. Branco, On the Pin-Thérien expansion of idempotent monoids, Semi-group Forum 49 1994,329–334.

    MATH  Google Scholar 

  35. M. J. J. Branco, Some variants of the concatenation product and the kernel category, 1995, to appear.

    Google Scholar 

  36. J. A. Brzozowski, Hierarchies of aperiodic languages, RAIRO Inform. Théor. 10 1976, 33–49.

    MathSciNet  Google Scholar 

  37. J. A. Brzozowski, Open problems about regular languages, Formal language theory, perspectives and open problems, R. V. Book (ed.), Academic Press, New York 1980, 23–47.

    Google Scholar 

  38. J. A. Brzozowski, K. Culik II and A. Gabrielian, Classification of noncounting events, J. Comp. Syst. Sci. 5 1971, 41–53.

    MathSciNet  MATH  Google Scholar 

  39. J. A. Brzozowski and F. E. Fich, Languages of R.-trivial monoids, J. Comput. System Sci. 20 1980, 32–49.

    MathSciNet  MATH  Google Scholar 

  40. J. A. Brzozowski and R. Knast, The dot-depth hierarchy of star-free languages is infinite, J. Comput. System Sci. 16 1978, 37–55.

    MathSciNet  MATH  Google Scholar 

  41. J. A. Brzozowski and I. Simon, Characterizations of locally testable languages, Discrete Math. 4 1973, 243–271.

    MathSciNet  MATH  Google Scholar 

  42. J. R. Biichi, Weak second-order arithmetic and finite automata, Z. Math. Logik und Grundl. Math. 6 1960, 66–92.

    MathSciNet  Google Scholar 

  43. S. Cho and D. T. Huynh, Finite automaton aperiodicity is PSPACE-complete, Thcor. Comput. Sci. 88 1991, 99–116.

    MathSciNet  MATH  Google Scholar 

  44. R. S. Cohen and J. A. Brzozowski, On star-free events, Proc. Hawaii Int. Conf. on System Science, Honolulu, 1968, 1–4.

    MathSciNet  MATH  Google Scholar 

  45. R. S. Cohen and J. A. Brzozowski, Dot-depth of star-free events, J. Comput. System Sci. 5 1971, 1–15.

    MathSciNet  MATH  Google Scholar 

  46. J. Cohen, D. Perrin and J.-E. Pin, On the expressive power of temporal logic, J. Comput. System Sci. 46 1993, 271–294.

    MathSciNet  MATH  Google Scholar 

  47. D. Cowan, Inverse monoids of dot-depth 2, Int. Jour. Alg. and Comp. 3 1993, 411–424.

    MathSciNet  MATH  Google Scholar 

  48. F. Dejean and M. P. Schützenberger, On a question of Eggan, Information and Control 9 1966, 23–25.

    MathSciNet  MATH  Google Scholar 

  49. A. De Luca, On some properties of the syntactic semigroup of very pure subsemigroups, RAIRO Inf. Théor. 14 1980, 39–56.

    MathSciNet  MATH  Google Scholar 

  50. A. De Luca, D. Perrin, A. Restivo and S. Termini, Synchronization and simplification, Discrete Math. 27 1979, 297–308.

    MathSciNet  MATH  Google Scholar 

  51. A. De Luca and A. Restivo, A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup, Inf. and Control 44 1980, 300–319.

    MathSciNet  MATH  Google Scholar 

  52. S. Eilenberg, Automata, languages and machines, Vol. A, Academic Press, New York, 1974.

    MATH  Google Scholar 

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

    MATH  Google Scholar 

  54. Z. Esik and I. Simon, Modeling literal morphisme by shuffle, Semigroup Forum, to appear.

    Google Scholar 

  55. F. E. Fich and J. A. Brzozowski, A characterization of a dot-depth two analogue of generalized definite languages, Proc. 6th ICALP, Lect. Notes in Comp. Sci 71 Springer-Verlag, Berlin 1979, 230–244.

    Google Scholar 

  56. D. Gabbay, A. Pnueli, S. Shelah and J. Stavi, On the temporal analysis of fairness, Proc. 7th ACM Symp. Princ. Prog. Lang. 1980, 163–173.

    Google Scholar 

  57. A. Ginzburg, About some properties of definite, reverse definite and related automata, IEEE Trans. Electron. Comput. 15 1966, 806–810.

    MATH  Google Scholar 

  58. M. Hall Jr., A topology for free groups and related groups, Ann. of Maths, 52 1950, 127–139.

    MathSciNet  MATH  Google Scholar 

  59. K. Hashiguchi, Regular languages of star height one, Information and Control 53 1982, 199–210.

    MathSciNet  MATH  Google Scholar 

  60. K. Hashiguchi, Representation theorems on regular languages, J. Comput. System Sci. 27 1983, 101–115.

    MathSciNet  MATH  Google Scholar 

  61. K. Hashiguchi, Algorithms for Determining Relative Star Height and Star Height, Information and Computation 78 1988, 124–169.

    MathSciNet  MATH  Google Scholar 

  62. K. Henckell, S. W. Margolis, J.-E. Pin and J. Rhodes, Ash’s Type II Theorem, Profinite Topology and Malcev Products, Int. Jour. Alg. and Comp. 1 1991, 411–436.

    MathSciNet  MATH  Google Scholar 

  63. K. Henckell and J. Rhodes, The theorem of Knast, the PG = BG and Type II Conjectures, in Monoids and Semigroups with Applications, J. Rhodes (ed.), Word Scientific, Singapore 1991, 453–463.

    MATH  Google Scholar 

  64. P. Higgins, A proof of Simon’s Theorem on piecewise testable languages, submitted.

    Google Scholar 

  65. J. Howie, An Introduction to Semigroup Theory, Academic Press, London, 1976.

    MATH  Google Scholar 

  66. J. Howie, Automata and Languages, Oxford Science Publications, Clarendon Press, Oxford, 1991.

    Google Scholar 

  67. P. Jones, Monoid varieties defined by xn+1 = x are local, Semigroup Forum 47 1993, 318–326.

    MathSciNet  MATH  Google Scholar 

  68. J. A. Kamp, Tense logic and the theory of linear order, Ph. D. Thesis, Univ. of California, Los Angeles, 1968.

    Google Scholar 

  69. M. Keenan and G. Lallement, On certain codes admitting inverse semigroups as syntactic monoids, Semigroup Forum 8 1974, 312–331.

    MathSciNet  MATH  Google Scholar 

  70. S. C. Kleene, Representation of events in nerve nets and finite automata, in Automata Studies,C. E. Shannon and J. McCarthy (eds.), Princeton University Press, Princeton, New Jersey, 1956, 3–42.

    Google Scholar 

  71. R. Knast, A semigroup characterization of dot-depth one languages, RAIRO Inform. Théor. 17 1983, 321–330.

    MathSciNet  MATH  Google Scholar 

  72. R. Knast, Some theorems on graph congruences, RAIRO Inform. Théor. 17 1983, 331–342.

    MathSciNet  Google Scholar 

  73. G. Lallement, Regular semigroups with D = R as syntactic monoids of finite prefix codes, Theor. Comput. Sci. 3 1977, 35–49.

    MATH  Google Scholar 

  74. G. Lallement, Cyclotomic polynomials and unions of groupsDiscrete Math. 24 1978, 19–36.

    MathSciNet  MATH  Google Scholar 

  75. G. Lallement, Semigroups and combinatorial applications, Wiley, New York, 1979.

    MATH  Google Scholar 

  76. G. Lallement and E. Milito, Recognizable languages and finite semilattices of groups, Semigroup Forum 11 1975, 181–185.

    MathSciNet  MATH  Google Scholar 

  77. E. Le Rest and M. Le Rest, Sur le calcul du monoïde syntactique d’un sousmonoïde finiment engendré, Semigroup Forum 21 1980, 173–185.

    MathSciNet  MATH  Google Scholar 

  78. M. Lothaire, Combinatorics on Words,Cambridge University Press, 1982.

    Google Scholar 

  79. S. W. Margolis, On the syntactic transformation semigroup of the language generated by a finite biprefix code, Theor. Comput. Sci., 21 1982, 225–230.

    MathSciNet  MATH  Google Scholar 

  80. S. W. Margolis, Kernel and expansions: an historical and technical perspective, in Monoids and semigroups with applications, J. Rhodes (ed.), World Scientific, Singapore, 1989, 3–30.

    Google Scholar 

  81. S. W. Margolis, On maximal pseudo-varieties of finite monoids and semi-groups, Izvestiya VUZ Matematika 39 1995, 65–70. English version, Russian Mathem. (Iz. VUZ) 39 1995, 60–64.

    Google Scholar 

  82. S. W. Margolis and J. E. Pin, Languages and inverse semigroups, 11th ICALP, Lect. Notes in Comp. Sci. 172 Springer-Verlag, Berlin 1984, 337–346.

    MATH  Google Scholar 

  83. S. W. Margolis and J. E. Pin, Product of group languages, FCT Conference, Lect. Notes in Comp. Sci. 199 Springer-Verlag, Berlin 1985, 285–299.

    Google Scholar 

  84. S. W. Margolis and J. E. Pin, On varieties of rational languages and variable-length code II, J. Pure Appl. Algebra 41 1986, 233–253.

    MathSciNet  MATH  Google Scholar 

  85. S. W. Margolis and J. E. Pin, Inverse semigroups and varieties of finite semi-groups, Journal of Algebra 110 1987, 306–323.

    MathSciNet  MATH  Google Scholar 

  86. R. McNaughton, Algebraic decision procedures for local testability, Math. Syst. Theor. 8 1974, 60–76.

    MathSciNet  MATH  Google Scholar 

  87. R. McNaughton and S. Pappert, Counter-free Automata, MIT Press, 1971.

    Google Scholar 

  88. A. R. Meyer, A note on star-free events, J. Assoc. Comput. Mach. 16 1969, 220–225.

    MathSciNet  MATH  Google Scholar 

  89. M. Perles, M. O. Rabin and E. Shamir, The theory of definite automata, IEEE. Trans. Electron. Comput. 12 1963, 233–243.

    MathSciNet  MATH  Google Scholar 

  90. D. Perrin, Sur certains semigroupes syntactiquesSéminaires de l’IRIA, Logiques et Automates, Paris 1971, 169–177.

    Google Scholar 

  91. D. Perrin and J.-F. Perrot, A propos des groupes dans certains monoïdes syntactiques, Lecture Notes in Mathematics 855 Springer-Verlag Berlin 1980, 82–91.

    Google Scholar 

  92. D. Perrin, Automata, Chapter 1 in Handbook of Theoretical Computer Science, J. Van Leeuwen (ed.), Vol B: Formal Models and Semantics, Elsevier Amsterdam 1990.

    Google Scholar 

  93. D. Perrin and J.-E. Pin, Semigroups and automata on infinite words, in NATO Advanced Study Institute Semigroups, Formal Languages and Groups, J. Fountain (ed.), Kluwer Academic Publishers, 1995, 49–72.

    MATH  Google Scholar 

  94. J. F. Perrot, Variétés de langages et opérations, Theor. Comput. Sci. 7 1978, 197–210.

    MATH  Google Scholar 

  95. J.-E. Pin, Sur le monoïde de L* lorsque L est un langage fini. Theor. Comput. Sci. 7 1978, 211–215.

    MATH  Google Scholar 

  96. J.-E. Pin, Variétés de langages et monoïde des parties, Semigroup Forum 20 1980, 11–47.

    MathSciNet  MATH  Google Scholar 

  97. J.-E. Pin, Propriétés syntactiques du produit non ambigu. 7th ICALP, Lect. Notes in Comp. Sci. 85 Springer-Verlag, Berlin 1980), 483–499.

    MATH  Google Scholar 

  98. J.-E. Pin, Variétés de langages et variétés de semigroupes, Thèse d’état, Université Paris VI 1981.

    Google Scholar 

  99. J.-E. Pin, Langages reconnaissables et codage préfixe pur, Langages reconnaissables et codage préfixe pur, in 8th ICALP, Lect. Notes in Comp. Sci. 115 Springer-Verlag, Berlin 1981, 184–192.

    MATH  Google Scholar 

  100. J.-E. Pin, Hiérarchies de concaténation, RAIRO Inform. Théor. 18 1984, 2346.

    MATH  Google Scholar 

  101. J.-E. Pin, Finite group topology and p-adic topology for free monoids, in 12th ICALP,Lect. Notes in Comp. Sci. 194 Springer-Verlag, Berlin 1985, 445–455.

    MATH  Google Scholar 

  102. J.-E. Pin, Variétés de langages formels, Masson, Paris, 1984. English translation: Varieties of formal languages, Plenum, New-York, 1986.

    Google Scholar 

  103. J.-E. Pin, Power semigroups and related varieties of finite semigroups, Semi-groups and Their Applications, S. M. Goberstein and P. M. Higgins (ed.), D. Reidel 1986, 139–152.

    Google Scholar 

  104. J.-E. Pin, A property of the Schiitzenberger product, Semigroup Forum 35 1987, 53–62.

    MathSciNet  Google Scholar 

  105. J.-E. Pin, Relational morphisms, transductions and operations on languages, in Formal properties of finite automata and applications, J.-E. Pin (ed.), Lect. Notes in Comp. Sci. 386 Springer-Verlag, Berlin 1989, 120–137.

    Google Scholar 

  106. J.-E. Pin, Topologies for the free monoid, Journal of Algebra 137 1991, 297–337.

    MathSciNet  MATH  Google Scholar 

  107. J.-E. Pin, Logic, semigroups and automata on words, Theor. Comput. Sci., Annals of Mathematics and Artificial Intelligence, 16 1996, 343–384.

    MathSciNet  Google Scholar 

  108. J.-E. Pin, Polynomial closure of group languages and open sets of the Hall topology, ICALP 1994, Lect. Notes in Comp. Sci. 820 Springer-Verlag, Berlin 1994, 424–435.

    Google Scholar 

  109. J.-E. Pin, Logic on words, Bulletin of the European Association of Theoretical Computer Science 54 1994, 145–165.

    MATH  Google Scholar 

  110. J.-E. Pin, Finite semigroups and recognizable languages: an introduction, in NATO Advanced Study Institute Semigroups, Formal Languages and Groups, J. Fountain (ed.), Kluwer Academic Publishers, 1995, 1–32.

    Google Scholar 

  111. J.-E. Pin, BG = PG, a success story, in NATO Advanced Study Institute Semigroups, Formal Languages and Groups, J. Fountain (ed.), Kluwer Academic Publishers, 1995, 33–47.

    Google Scholar 

  112. J.-E. Pin, A variety theorem without complementation, Izvestiya VUZ Matematika 39 1995, 80–90. English version, Russian Mathem. (Iz. VUZ) 39 1995, 74–83.

    Google Scholar 

  113. . J.-E. Pin, Polynomial closure of group languages and open sets of the Hall topology, extended version of [108], to appear in Theor. Comput. Sci.

    Google Scholar 

  114. J.-E. Pin and C. Reutenauer, A conjecture on the Hall topology for the free group, Notices of the London Math. Society 23 1991, 356–362.

    MathSciNet  MATH  Google Scholar 

  115. J.-E. Pin and J Sakarovitch, Operations and transductions that preserve rationality, 6th GI Conf., Lect. Notes in Comp. Sci. 145, Springer-Verlag, Berlin 1983, 277–288.

    Google Scholar 

  116. J.-E. Pin and J. Sakarovitch, Une application de la représentation matricielle des transductions, Theor. Comput. Sci. 35 1985, 271–293.

    MATH  Google Scholar 

  117. J.-E. Pin and H. Straubing, Remarques sur le dénombrement des variétés de monoïdes finis.C. R. Acad. Sci. Paris, Sér. A 292 1981, 111–113.

    MATH  Google Scholar 

  118. J.-E. Pin and H. Straubing, Monoids of upper triangular matrices, Colloquia Mathematica Societatis Janos Bolyai, Semigroups, Szeged, 39 1981, 259–272.

    MathSciNet  MATH  Google Scholar 

  119. J.-E. Pin, H. Straubing and D. Thérien, Small varieties of finite semigroups and extensions, J. Austral. Math. Soc. 37 1984, 269–281.

    MathSciNet  MATH  Google Scholar 

  120. J.-E. Pin, H. Straubing and D. Thérien, Locally trivial categories and unambiguous concatenation, J. Pure Appl. Algebra 52 1988, 297–311.

    MathSciNet  MATH  Google Scholar 

  121. J.-E. Pin, H. Straubing and D. Thérien, New results on the generalized star height problem, STACS 89, Lect. Notes in Comp. Sci. 349 Springer-Verlag, Berlin 1989, 458–467.

    Google Scholar 

  122. J.-E. Pin, H. Straubing and D. Thérien, Some results on the generalized star height problem, Information and Computation, 101 1992, 219–250.

    MathSciNet  MATH  Google Scholar 

  123. J.-E. Pin and D. Thérien, The bideterministic concatenation product, Int. Jour. Alg. and Comp. 3 1993, 535–555.

    MathSciNet  MATH  Google Scholar 

  124. J.-E. Pin and P. Weil, Profinite semigroups, Malcev products and identities, Journal of Algebra, 182 1996, 604–626.

    MathSciNet  MATH  Google Scholar 

  125. J.-E. Pin and P. Weil, A Reiterman theorem for pseudovarieties of finite first-order structures, Algebra Universalis, 35 1996, 577–595.

    MathSciNet  MATH  Google Scholar 

  126. J.-E. Pin and P. Weil, Polynomial closure and unambiguous product, ICALP 1995,Lect. Notes in Comp. Sci. 944 Springer-Verlag, Berlin 1995, 348–359.

    Google Scholar 

  127. J.-E. Pin and P. Weil, Polynomial closure and unambiguous product (full version), submitted.

    Google Scholar 

  128. M. O. Rabin and D. Scott, Finite automata and their decision problems, IBM J. Res. and Develop. 3 1959, 114–125. Reprinted in Sequential Machines, E. F. Moore (ed.), Addison-Wesley, Reading, Massachussetts, 1964, 63–91.

    Google Scholar 

  129. J. Reiterman, The Birkhoff theorem for finite algebras, Algebra Universalis 14 1982, 1–10.

    MathSciNet  MATH  Google Scholar 

  130. A. Restivo, Codes and aperiodic languages, Lect. Notes in Comp. Sci. 2 Springer-Verlag, Berlin 1973, 175–181.

    MathSciNet  MATH  Google Scholar 

  131. A. Restivo, On a question of McNaughton and Papert, Inf. Control 25 1974, 93–101.

    MathSciNet  MATH  Google Scholar 

  132. A. Restivo, A combinatorial property of codes having finite synchronization delay, Theor. Comput. Sci. 1 1975, 95–101.

    MathSciNet  MATH  Google Scholar 

  133. A. Restivo, Codes and automata, in Formal properties of finite automata and applications, J.-E. Pin (ed.), Lect. Notes in Comp. Sci. 386 Springer-Verlag, Berlin 1989, 186–198.

    Google Scholar 

  134. C. Reutenauer, Sur les variétés de langages et de monoïdes, Lect. Notes in Comp. Sci. 67 Springer-Verlag, Berlin 1979, 260–265.

    Google Scholar 

  135. C. Reutenauer, Une topologie du monoïde libre, Semigroup Forum 18 1979, 33–49.

    MathSciNet  MATH  Google Scholar 

  136. C. Reutenauer, Séries formelles et algèbres syntactiques, J. Algebra 66 1980, 448–483.

    MathSciNet  MATH  Google Scholar 

  137. C. Reutenauer, Sur mon article “Une topologie du monoïde libre”, Semigroup Forum 22 1981, 93–95.

    MathSciNet  MATH  Google Scholar 

  138. J. Rhodes and B. Tilson, The kernel of monoid morphisms, J. Pure Appl. Algebra 62 1989, 227–268.

    MathSciNet  MATH  Google Scholar 

  139. J. Rhodes and P. Weil, Algebraic and topological theory of languages, Informatique Théorique et Applications 29 1995, 1–44.

    MathSciNet  MATH  Google Scholar 

  140. L. Ribes and P. A. Zalesskii, On the profinite topology on a free group, Bull. London Math. Soc. 25 1993, 37–43.

    MathSciNet  MATH  Google Scholar 

  141. M. Robson, Some Languages of Generalised Star Height One, LITP Technical Report 89–62 1989, 9 pages.

    Google Scholar 

  142. M. Robson, More Languages of Generalised Star Height 1, Theor. Comput. Sci. 106 1992 327–335.

    MathSciNet  MATH  Google Scholar 

  143. J. J. Rotman, The theory of groups, An introduction, Allyn and Bacon, Boston, 1973.

    MATH  Google Scholar 

  144. M. P. Schützenberger, On finite monoids having only trivial subgroups, Information and Control 8 1965, 190–194.

    MathSciNet  MATH  Google Scholar 

  145. M. P. Schützenberger, Sur certaines variétés de monoïdes finis, in Automata Theory,E. R. Caianiello (ed.), Academic Press, New-York, 1966, 314–319.

    Google Scholar 

  146. M. P. Schützenberger, Sur les monoïdes finis dont les groupes sont commutatifs, RAIRO Inf. Theor. 1 1974, 55–61.

    MATH  Google Scholar 

  147. M. P. Schützenberger, Sur certaines opérations de fermeture dans les langages rationnels, Ist. Naz. Alta Math. Symp. Math. 15 1975, 245–253.

    MATH  Google Scholar 

  148. M. P. Schützenberger, Sur le produit de concaténation non ambigu, Semigroup Forum 13 1976, 47–75.

    MathSciNet  MATH  Google Scholar 

  149. C. Selmi, Over testable languages, Theor. Comput. Sci., to appear.

    Google Scholar 

  150. C. Selmi, Strongly locally testable semigroups with commuting idempotents and associated languages, Informatique Théorique et Applications, to appear.

    Google Scholar 

  151. H. Sezinando, The varieties of languages corresponding to the varieties of finite band monoids, Semigroup Forum 44 1992, 283–305.

    MathSciNet  MATH  Google Scholar 

  152. I. Simon Piecewise testable events Proc.2 nd GI Conf., Lect. Notes in Comp. Sci. 33 Springer-Verlag, Berlin 1975, 214–222.

    MATH  Google Scholar 

  153. I. Simon, Properties of factorization forests in Formal properties of finite automata and applications, J.-E. Pin (ed.)Lect. Notes in Comp. Sci. 386 Springer-Verlag, Berlin 1989, 34–55.

    Google Scholar 

  154. I. Simon, Factorization forests of finite heightTheor. Comput. Sci. 72 1990 65–94.

    MathSciNet  MATH  Google Scholar 

  155. I. Simon, A short proof of the factorization forest theoremin Tree Automata and Languages, M. Nivat and A. Podelski eds., Elsevier Science Publ., Amsterdam, 1992, 433–438.

    Google Scholar 

  156. I. Simon, The product of rational languages, Proceedings of ICALP 1993, Lect. Notes in Comp. Sci. 700 Springer-Verlag, Berlin 1993, 430–444.

    Google Scholar 

  157. J. Stern, Characterization of some classes of regular events, Theor. Comput. Sci. 35 1985, 17–42.

    MathSciNet  MATH  Google Scholar 

  158. J. Stern, Complexity of some problems from the theory of automata, Inform. and Control 66 1985, 63–176.

    MathSciNet  Google Scholar 

  159. H. Straubing, Families of recognizable sets corresponding to certain varieties of finite monoids, J. Pure Appl. Algebra,15 1979, 305–318.

    MathSciNet  MATH  Google Scholar 

  160. H. Straubing, Aperiodic homomorphisms and the concatenation product of recognizable sets, J. Pure Appl. Algebra 15 1979, 319–327.

    MathSciNet  MATH  Google Scholar 

  161. H. Straubing, Recognizable sets and power sets of finite semigroups, Semi-group Forum, 18 1979, 331–340.

    MathSciNet  MATH  Google Scholar 

  162. H. Straubing, On finite.7-trivial monoids, Semigroup Forum 19 1980, 107–110.

    MathSciNet  MATH  Google Scholar 

  163. H. Straubing, A generalization of the Schützenberger product of finite monoids, Theor. Comput. Sci. 13 1981, 137–150.

    MATH  Google Scholar 

  164. H. Straubing, Relational morphisms and operations on recognizable sets, RAI-RO Inf. Theor. 15 1981, 149–159.

    MathSciNet  MATH  Google Scholar 

  165. H. Straubing, The variety generated by finite nilpotent monoids, Semigroup Forum 24 1982, 25–38.

    MathSciNet  MATH  Google Scholar 

  166. H. Straubing, Finite semigroups varieties of the form V * D, J. Pure Appl. Algebra 36 1985, 53–94.

    MathSciNet  MATH  Google Scholar 

  167. H. Straubing, Semigroups and languages of dot-depth two, Theor. Comput. Sci. 58 1988, 361–378.

    MathSciNet  MATH  Google Scholar 

  168. H. Straubing, The wreath product and its application, in Formal properties of finite automata and applications, J.-E. Pin (ed.), Lect. Notes in Comp. Sci. 386 Springer-Verlag, Berlin 1989, 15–24.

    Google Scholar 

  169. H. Straubing, Finite automata, formal logic and circuit complexity, Birkhäuser, Boston, 1994.

    MATH  Google Scholar 

  170. H. Straubing and D. Thérien, Partially ordered finite monoids and a theorem of I. Simon, J. of Algebra 119 1985, 393–399.

    MathSciNet  MATH  Google Scholar 

  171. H. Straubing, D. Thérien and W. Thomas, Regular languages defined with generalized quantifiers, in Proc. 15th ICALP, Lect. Notes in Comp. Sci. 317 1988, 561–575.

    Google Scholar 

  172. H. Straubing and P. Weil, On a conjecture concerning dot-depth two languages, Theoret. Comp. Sci. 104 1992, 161–183.

    MathSciNet  MATH  Google Scholar 

  173. D. Thérien, Languages of nilpotent and solvable groups, Proceedings of ICALP 1979, Lect. Notes in Comp. Sci. 71 Springer-Verlag, Berlin 1979, 616–632.

    MATH  Google Scholar 

  174. D. Thérien, Classification of finite monoids: the language approach, Theoret. Comp. Sci. 14 1981, 195–208.

    MathSciNet  MATH  Google Scholar 

  175. D. Thérien, Recognizable languages and congruences, Semigroup Forum 23 1981, 371–373.

    MATH  Google Scholar 

  176. D. Thérien, Languages recognized by unions of groups, Technical Report SOCS-82.13, McGill University, 1982.

    Google Scholar 

  177. D. Thérien, Subword counting and nilpotent groups, in Combinatorics on Words: Progress and Perspectives, L. J. Cummings (ed.), Academic Press, New York 1983, 297–306.

    Google Scholar 

  178. D. Thérien Sur les monoïdes dont les groupes sont résolubles Semigroup Forum 26 1983, 89–101.

    MathSciNet  MATH  Google Scholar 

  179. D. Thérien A language theoretic interpretation of Schützenberger representations Semigroup Forum 28 1984, 235–248.

    MathSciNet  MATH  Google Scholar 

  180. D. Thérien, Catégories et langages de dot-depth un, RAIRO Inf. Théor. et Applications 22 1988, 437–445.

    MATH  Google Scholar 

  181. D. Thérien On the equation xt = xt+r in categories Semigroup Forum 37 1988, 265–271.

    MathSciNet  MATH  Google Scholar 

  182. D. Thérien, Two-sided wreath products of categories, J. Pure Appl. Algebra 74 1991, 307–315.

    MathSciNet  MATH  Google Scholar 

  183. D. Thérien and A. Weiss, Graph congruences and wreath products, J. Pure Appl. Algebra 36 1985, 205–215.

    MathSciNet  MATH  Google Scholar 

  184. A. Weiss and D. Thérien, Varieties of finite categories, Informatique Théorique et Applications 20 1986, 357–366.

    MathSciNet  MATH  Google Scholar 

  185. W. Thomas, Classifying regular events in symbolic logic, J. Comput. Syst. Sci. 25 1982, 360–375.

    MathSciNet  MATH  Google Scholar 

  186. W. Thomas, An application of the Ehrenfeucht-Fraïssé game in formal language theory, Bull. Soc. Math. de France 16 1984, 11–21.

    MATH  Google Scholar 

  187. W. Thomas A concatenation game and the dot-depth hierarchy, in Computation Theory and Logic, E. Böger (ed.), Lect. Notes in Comp. Sci. 270, Springer-Verlag, Berlin 1987, 415–426.

    Google Scholar 

  188. B. Tilson, Chapters 11 and 12 of [53].

    Google Scholar 

  189. B. Tilson, Categories as algebras, J. Pure Appl. Algebra 48 1987, 83–198.

    MathSciNet  MATH  Google Scholar 

  190. P. Weil, Groups in the syntactic monoid of a composed code, J. Pure Appl. Algebra 42 1986, 297–319.

    MathSciNet  MATH  Google Scholar 

  191. P. Weil, Inverse monoids of dot-depth two, Theoret. Comp. Sci. 66 1989, 233–245.

    MathSciNet  MATH  Google Scholar 

  192. P. Weil, Products of languages with counter, Theoret. Comp. Sci. 76 1990, 251–260.

    MathSciNet  MATH  Google Scholar 

  193. P. Weil, Implicit operations on pseudovarieties: an introductionin Monoids and semigroups with applications, J. Rhodes (ed.), World Scientific, Singapore 1991, 89–104.

    Google Scholar 

  194. P. Weil, Closure of varieties of languages under products with counter, J. Comput. System Sci. 45 1992, 316–339.

    MathSciNet  MATH  Google Scholar 

  195. P. Weil, Some results on the dot-depth hierarchy, Semigroup Forum 46 1993, 352–370.

    MathSciNet  MATH  Google Scholar 

  196. A. Weiss The local and global varieties induced by nilpotent monoids Informatique Théorique et Applications 20 1986, 339–355.

    MathSciNet  MATH  Google Scholar 

  197. A. Weiss and D. Thérien, Varieties of finite categories, Informatique Théorique et Applications 20 1986, 357–366.

    MathSciNet  MATH  Google Scholar 

  198. T. Wilke, An Eilenberg theorem for oo-languages, in Automata Languages and Programming, Lect. Notes in Comp. Sci. 510, Springer-Verlag, Berlin 1991, 588–599.

    MATH  Google Scholar 

  199. T. Wilke, An algebraic theory for regular languages of finite and infinite words, Int. J. Alg. Comput. 3 1993, 447–489.

    MathSciNet  MATH  Google Scholar 

Download references

Authors
  1. Jean-Eric Pin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Leiden University, P.O. Box 9512, Leiden, RA, NL-2300, The Netherlands

    Grzegorz Rozenberg

  2. Turku Centre for Computer Science Data City, Turku, FIN-20520, Finland

    Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Pin, JE. (1997). Syntactic Semigroups. In: Rozenberg, G., Salomaa, A. (eds) Handbook of Formal Languages. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-59136-5_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-59136-5_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-63863-3

  • Online ISBN: 978-3-642-59136-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation