Delivery: Can be download immediately after purchasing. For new customer, we need process for verification from 30 mins to 12 hours.
Version: PDF/EPUB. If you need EPUB and MOBI Version, please send contact us.
Compatible Devices: Can be read on any devices.
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.
This is a digital product.
Finiteness and Regularity in Semigroups and Formal Languages is written by Aldo de Luca; Stefano Varricchio and published by Springer. The Digital and eTextbook ISBNs for Finiteness and Regularity in Semigroups and Formal Languages are 9783642598494, 3642598498 and the print ISBNs are 9783540637714, 3540637710.
Reviews
There are no reviews yet.