Semigroups And Formal Languages
Download Semigroups And Formal Languages PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Semigroups And Formal Languages 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.
Semigroups And Formal Languages - Proceedings Of The International Conference
Author: Gracinda M S Gomes
language: en
Publisher: World Scientific
Release Date: 2007-06-11
This festschrift volume in honour of Donald B McAlister on the occasion of his 65th birthday presents papers from leading researchers in semigroups and formal languages. The contributors cover a number of areas of current interest: from pseudovarieties and regular languages to ordered groupoids and one-relator groups, and from semigroup algebras to presentations of monoids and transformation semigroups. The papers are accessible to graduate students as well as researchers seeking new directions for future work.
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.
Semigroups and Formal Languages
This festschrift volume in honour of Donald B McAlister on the occasion of his 65th birthday presents papers from leading researchers in semigroups and formal languages. The contributors cover a number of areas of current interest: from pseudovarieties and regular languages to ordered groupoids and one-relator groups, and from semigroup algebras to presentations of monoids and transformation semigroups. The papers are accessible to graduate students as well as researchers seeking new directions for future work.