Semigroups In Discrete Mathematics

Download Semigroups In Discrete Mathematics PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Semigroups In Discrete Mathematics book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
The Analytical and Topological Theory of Semigroups

The aim of the series is to present new and important developments in pure and applied mathematics. Well established in the community over two decades, it offers a large library of mathematics including several important classics. The volumes supply thorough and detailed expositions of the methods and ideas essential to the topics in question. In addition, they convey their relationships to other parts of mathematics. The series is addressed to advanced readers wishing to thoroughly study the topic. Editorial Board Lev Birbrair, Universidade Federal do Ceará, Fortaleza, Brasil Walter D. Neumann, Columbia University, New York, USA Markus J. Pflaum, University of Colorado, Boulder, USA Dierk Schleicher, Jacobs University, Bremen, Germany Katrin Wendland, University of Freiburg, Germany Honorary Editor Victor P. Maslov, Russian Academy of Sciences, Moscow, Russia Titles in planning include Yuri A. Bahturin, Identical Relations in Lie Algebras (2019) Yakov G. Berkovich and Z. Janko, Groups of Prime Power Order, Volume 6 (2019) Yakov G. Berkovich, Lev G. Kazarin, and Emmanuel M. Zhmud', Characters of Finite Groups, Volume 2 (2019) Jorge Herbert Soares de Lira, Variational Problems for Hypersurfaces in Riemannian Manifolds (2019) Volker Mayer, Mariusz Urbański, and Anna Zdunik, Random and Conformal Dynamical Systems (2021) Ioannis Diamantis, Boštjan Gabrovšek, Sofia Lambropoulou, and Maciej Mroczkowski, Knot Theory of Lens Spaces (2021)
Finiteness and Regularity in Semigroups and Formal Languages

Author: Aldo de Luca
language: en
Publisher: Springer Science & Business Media
Release Date: 2012-12-06
The aim of this monograph is to present some recent research work on the combinatorial aspects of the theory of semigroups which are of great inter est for both algebra and theoretical computer science. This research mainly concerns that part of combinatorics of finite and infinite words over a finite alphabet which is usually called the theory of "unavoidable" regularities. The unavoidable regularities ofsufficiently large words over a finite alpha bet are very important in the study of finiteness conditions for semigroups. This problem consists in considering conditions which are satisfied by a fi nite semigroup and are such as to assure that a semigroup satisfying them is finite. The most natural requirement is that the semigroup is finitely gener ated. Ifone supposes that the semigroup is also periodic the study offiniteness conditions for these semigroups (or groups) is called the Burnside problem for semigroups (or groups). There exists an important relationship with the theory of finite automata because, as is well known, a language L over a fi nite alphabet is regular (that is, recognizable by a finite automaton) if and only if its syntactic monoid S(L) is finite. Hence, in principle, any finite ness condition for semigroups can be translated into a regularity condition for languages. The study of finiteness conditions for periodic languages (Le. , such that the syntactic semigroup is periodic) has been called the Burnside problem for languages.