Semigroup Forum

, Volume 96, Issue 2, pp 377–395 | Cite as

Left and right negatively orderable semigroups and a one-sided version of Simon’s theorem

Research Article
  • 95 Downloads

Abstract

We study the classes \(\mathrm {LNO}\) and \(\mathrm {RNO}\) of left and right negatively orderable semigroups, arising as natural one-sided generalizations of negatively orderable semigroups (\(\mathrm {NO}\)). Negatively ordered monoids are well-known, for instance, from an equivalent formulation by Straubing and Thérien, of a celebrated theorem by I. Simon on piecewise testable languages. The main aim of this paper is to prove a one-sided version of Simon’s theorem for \(\mathrm {LNO}\) (\(\mathrm {RNO}\)). Analogues of some well-known results about negatively orderable semigroups are established in these cases. A characterisation of right negatively orderable semigroups as semigroups of certain type of decreasing mappings on partially ordered sets is obtained. We present sets of quasi-identities defining the quasivarieties \(\mathrm {LNO}\) and \(\mathrm {RNO}\) and show that these classes cannot be defined by finite sets of quasi-identities. We prove \(\mathrm {NO}=\mathrm {LNO}\cap \mathrm {RNO}\) and describe \(\mathrm {LNO}\vee \mathrm {RNO}\). As a one-sided version of Simon’s theorem, the pseudovariety generated by all finite semigroups in \(\mathrm {LNO}\) (\(\mathrm {RNO}\)) is determined and an Eilenberg-type correspondence between this pseudovariety and a variety of languages is established.

Keywords

Semigroup Language Pseudovariety Ordered semigroup Quasiorder Syntactic semigroup 

References

  1. 1.
    Birkhoff, G.: On the structure of abstract algebras. Proc. Camb. Philos. Soc. 31, 433–454 (1935)CrossRefMATHGoogle Scholar
  2. 2.
    Brzozowski, J.A., Simon, I.: Characterizations of locally testable languages. Discrete Math. 4, 243–271 (1973)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Brzozowski, J.A., Fich, F.E.: Languages of \(\fancyscript {R}\)-trivial monoids. J. Comput. System Sci. 20, 32–49 (1980)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Eilenberg, S.: Automata, Languages, and Machines, vol. B. Academic Press, New York (1976)MATHGoogle Scholar
  5. 5.
    Fuchs, L.: Partially Ordered Algebraic Systems. Pergamon Press, Oxford (1963)MATHGoogle Scholar
  6. 6.
    Gould, V., Shaheen, L.: Perfection for pomonoids. Semigroup Forum 81(1), 102–127 (2010)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Heatherly, H.E., Tucci, R.P.: Negatively ordered semigroups. JP J. Algebra Number Theory Appl. 30(1), 81–97 (2013)MathSciNetMATHGoogle Scholar
  8. 8.
    Henckell, K., Pin, J.-E.: Ordered monoids and \(\fancyscript {J}\)-trivial monoids. In: Birget, J.-C., Margolis, S., Meakin, J., Sapir, M.V. (eds.) Algorithmic Problems in Groups and Semigroups, pp. 121–137. Birkhäuser, Boston (2000)CrossRefGoogle Scholar
  9. 9.
    Higgins, P.M.: A proof of Simon’s theorem on piecewise testable languages. Theor. Comput. Sci. 178, 257–264 (1997)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Howie, J.M.: Fundamentals of Semigroup Theory. Clarendon Press, Oxford (1995)MATHGoogle Scholar
  11. 11.
    Juhasz, Z., Vernitski, A.: Filters in (quasiordered) semigroups and lattices of filters. Commun. Algebra 39(11), 4319–4335 (2011)MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    Juhasz, Z., Vernitski, A.: Using filters to describe congruences and band congruences of semigroups. Semigroup Forum 83(2), 320–334 (2011)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Juhasz, Z., Vernitski, A.: Semigroups with operation-compatible Green’s quasiorders. Semigroup Forum 83(2), 387–402 (2016)MathSciNetCrossRefMATHGoogle Scholar
  14. 14.
    Juhasz, Z.: Left and right negatively orderable semigroups where every element has a left and a right identity. Semigroup Forum. (submitted)Google Scholar
  15. 15.
    Kleene, S.C.: Representation of events in nerve nets and finite automata. In: Shannon, C.E., McCarthy, J. (eds.) Automata Studies, pp. 3–42. Princeton University Press, Princeton (1956)Google Scholar
  16. 16.
    Lallement, G.: Semigroups and Combinatorial Applications. Wiley, New York (1979)MATHGoogle Scholar
  17. 17.
    McNaughton, R.: Algebraic decision procedures for local testability. Math. Syst. Theor. 8, 60–76 (1974)MathSciNetCrossRefMATHGoogle Scholar
  18. 18.
    Pin, J.-E.: Varieties of Formal Languages, pp. 185–196. North Oxford Academic Publishers, Oxford (1986)CrossRefGoogle Scholar
  19. 19.
    Pin, J.-E.: A variety theorem without complementation. Izvestiya VUZ Matematika 39, 80–90 (1995). (English version: Russian Mathem. (Iz. VUZ) 39 (1995), 74-83)Google Scholar
  20. 20.
    Pin, J.-E.: Syntactic Semigroups, in Handbook of Formal Languages, vol. 1, pp. 679–746. Springer, Berlin (1997)CrossRefGoogle Scholar
  21. 21.
    Satyanarayana, M.: Positively Ordered Semigroups, Lecture Notes in Pure and Applied Mathematics, vol. 42. Marcel Dekker, Inc, New York (1979)Google Scholar
  22. 22.
    Schützenberger, M.P.: On finite monoids having only trivial subgroups. Inf. Control 8, 190–194 (1965)MathSciNetCrossRefMATHGoogle Scholar
  23. 23.
    Simon, I.: Piecewise testable events. In: Proceedings of the 2nd GI Conference, Lecture Notes in Computer Science, vol. 33, pp. 34–55. Springer, Berlin (1989)Google Scholar
  24. 24.
    Straubing, H.: On finite J-trivial monoids. Semigroup Forum 19, 107–110 (1980)MathSciNetCrossRefMATHGoogle Scholar
  25. 25.
    Straubing, H., Thérien, D.: Partially ordered monoids and a theorem of I. Simon. J. Algebra 119, 393–399 (1988)MathSciNetCrossRefMATHGoogle Scholar
  26. 26.
    Vernitski, A.S.: The semigroups of order-preserving mappings: quest for quasi-identities. In: Proceedings of the Semigroup Conference in St Andrews (1997)Google Scholar
  27. 27.
    Vernitski, A.S.: Studying semigroups of mappings using quasi-identities. Semigroup Forum 63, 387–395 (2001)MathSciNetCrossRefMATHGoogle Scholar
  28. 28.
    Vernitski, A.S.: Ordered and J-trivial semigroups as divisors of semigroups of languages. Int. J. Algebra Comput. 18(7), 1223–1229 (2008)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of Computer Algebra, Faculty of InformaticsEötvös Loránd UniversityBudapestHungary

Personalised recommendations