Document Open Access Logo

A Note on the Join of Varieties of Monoids with LI

Author Nathan Grosshans

PDF
Thumbnail PDF

File

LIPIcs.MFCS.2021.51.pdf
  • Filesize: 0.74 MB
  • 16 pages

Document Identifiers

Author Details

Nathan Grosshans
  • Fachbereich Elektrotechnik/Informatik, University of Kassel, Germany

Acknowledgements

I want to thank Thomas Place, who suggested the link between essentially-V stamps and V∨LI, but also Luc Segoufin who started the discussion with Thomas Place and encouraged me to write the present article. My thanks go as well to the anonymous referees for their helpful comments and suggestions. Finally, I want to mention that the introductions of Jean-Éric Pin’s future book on algebraic automata theory and of Marc Zeitoun’s works cited in the references have been helpful inspirations for my own introduction.

Cite AsGet BibTex

Nathan Grosshans. A Note on the Join of Varieties of Monoids with LI. In 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 202, pp. 51:1-51:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
https://doi.org/10.4230/LIPIcs.MFCS.2021.51

Abstract

In this note, we give a characterisation in terms of identities of the join of V with the variety of finite locally trivial semigroups LI for several well-known varieties of finite monoids V by using classical algebraic-automata-theoretic techniques. To achieve this, we use the new notion of essentially-V stamps defined by Grosshans, McKenzie and Segoufin and show that it actually coincides with the join of V and LI precisely when some natural condition on the variety of languages corresponding to V is verified. This work is a kind of rediscovery of the work of J. C. Costa around 20 years ago from a rather different angle, since Costa’s work relies on the use of advanced developments in profinite topology, whereas what is presented here essentially uses an algebraic, language-based approach.

Subject Classification

ACM Subject Classification
  • Theory of computation → Formal languages and automata theory
  • Theory of computation → Algebraic language theory
Keywords
  • Varieties of monoids
  • join
  • LI

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. Douglas Albert, Robert Baldinger, and John Rhodes. Undecidability of the identity problem for finite semigroups. J. Symb. Log., 57(1):179-192, 1992. URL: https://doi.org/10.2307/2275184.
  2. Jorge Almeida. Some pseudovariety joins involving the pseudovariety of finite groups. Semigroup Forum, 37(1):53-57, 1988. URL: https://doi.org/10.1007/bf02573123.
  3. Jorge Almeida. Finite Semigroups and Universal Algebra, volume 3. WORLD SCIENTIFIC, 1995. URL: https://doi.org/10.1142/2481.
  4. Jorge Almeida and Assis Azevedo. The join of the pseudovarieties of R-trivial and L-trivial monoids. Journal of Pure and Applied Algebra, 60(2):129-137, 1989. URL: https://doi.org/10.1016/0022-4049(89)90125-4.
  5. Jorge Almeida and Pascal Weil. Free profinite R-trivial monoids. Int. J. Algebra Comput., 7(5):625-672, 1997. URL: https://doi.org/10.1142/S0218196797000289.
  6. Assis Azevedo. The join of the pseudovariety J with permutative pseudovarieties. In Lattices, Semigroups, and Universal Algebra, pages 1-11. Springer US, 1990. URL: https://doi.org/10.1007/978-1-4899-2608-1_1.
  7. Assis Azevedo and Marc Zeitoun. Three examples of join computations. Semigroup Forum, 57(2):249-277, 1998. URL: https://doi.org/10.1007/pl00005976.
  8. Laura Chaubard, Jean-Éric Pin, and Howard Straubing. First order formulas with modular predicates. In 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 12-15 August 2006, Seattle, WA, USA, Proceedings, pages 211-220. IEEE Computer Society, 2006. URL: https://doi.org/10.1109/LICS.2006.24.
  9. José Carlos Costa. Some pseudovariety joins involving locally trivial semigroups. Semigroup Forum, 64(1):12-28, 2001. URL: https://doi.org/10.1007/s002330010060.
  10. José Carlos Costa. Some pseudovariety joins involving groups and locally trivial semigroups. In Semigroups, Algorithms, Automata and Languages, pages 341-348. WORLD SCIENTIFIC, 2002. URL: https://doi.org/10.1142/9789812776884_0013.
  11. Samuel Eilenberg. Automata, Languages, and Machines. A. Pure and applied mathematics. Academic Press, New York, 1974. URL: https://www.worldcat.org/oclc/310535248.
  12. Samuel Eilenberg. Automata, Languages, and Machines. B. Pure and applied mathematics. Academic Press, New York, 1976. URL: https://www.worldcat.org/oclc/310535259.
  13. Nathan Grosshans, Pierre McKenzie, and Luc Segoufin. Tameness and the power of programs over monoids in DA. CoRR, abs/2101.07495, 2021. URL: http://arxiv.org/abs/2101.07495.
  14. Jean-Éric Pin. Varieties of Formal Languages. North Oxford, London and Plenum, New-York, 1986. (Traduction de Variétés de langages formels). Google Scholar
  15. Jean-Éric Pin. Syntactic semigroups. In Grzegorz Rozenberg and Arto Salomaa, editors, Handbook of Formal Languages, Volume 1: Word, Language, Grammar, pages 679-746. Springer, 1997. URL: https://doi.org/10.1007/978-3-642-59136-5_10.
  16. Jean-Éric Pin and Howard Straubing. Some results on 𝒞-varieties. RAIRO Theor. Informatics Appl., 39(1):239-262, 2005. URL: https://doi.org/10.1051/ita:2005014.
  17. Jan Reiterman. The Birkhoff theorem for finite algebras. Algebra Universalis, 14(1):1-10, 1982. URL: https://doi.org/10.1007/bf02483902.
  18. Marcel-Paul Schützenberger. On finite monoids having only trivial subgroups. Inf. Control., 8(2):190-194, 1965. URL: https://doi.org/10.1016/S0019-9958(65)90108-7.
  19. Imre Simon. Piecewise testable events. In H. Barkhage, editor, Automata Theory and Formal Languages, 2nd GI Conference, Kaiserslautern, May 20-23, 1975, volume 33 of Lecture Notes in Computer Science, pages 214-222. Springer, 1975. URL: https://doi.org/10.1007/3-540-07407-4_23.
  20. Howard Straubing. On logical descriptions of regular languages. In Sergio Rajsbaum, editor, LATIN 2002: Theoretical Informatics, 5th Latin American Symposium, Cancun, Mexico, April 3-6, 2002, Proceedings, volume 2286 of Lecture Notes in Computer Science, pages 528-538. Springer, 2002. URL: https://doi.org/10.1007/3-540-45995-2_46.
  21. Marc Zeitoun. The join of the pseudovarieties of idempotent semigroups and locally trivial semigroups. Semigroup Forum, 50(1):367-381, 1995. URL: https://doi.org/10.1007/bf02573532.
  22. Marc Zeitoun. On the decidability of the membership problem of the pseudovariety J∨B. Int. J. Algebra Comput., 5(1):47-64, 1995. URL: https://doi.org/10.1142/S0218196795000057.
  23. Marc Zeitoun. On the join of two pseudovarieties. Semigroups, Automata and Languages, eds. J. Almeida, GMS Gomes, and PV Silva. World Scientific, pages 281-288, 1996. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact