SULJE VALIKKO

avaa valikko

Finiteness and Regularity in Semigroups and Formal Languages
97,90 €
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Sivumäärä: 240 sivua
Asu: Pehmeäkantinen kirja
Painos: Softcover reprint of
Julkaisuvuosi: 2011, 18.09.2011 (lisätietoa)
Kieli: Englanti
Tuotesarja: Monographs in Theoretical Computer Science. An EATCS Series
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.

Tuotetta lisätty
ostoskoriin kpl
Siirry koriin
LISÄÄ OSTOSKORIIN
Tilaustuote | Arvioimme, että tuote lähetetään meiltä noin 5-6 viikossa. | Tilaa jouluksi viimeistään 13.11.2024
Myymäläsaatavuus
Helsinki
Tapiola
Turku
Tampere
Finiteness and Regularity in Semigroups and Formal Languages
Näytä kaikki tuotetiedot
ISBN:
9783642641503
Sisäänkirjautuminen
Kirjaudu sisään
Rekisteröityminen
Oma tili
Omat tiedot
Omat tilaukset
Omat laskut
Lisätietoja
Asiakaspalvelu
Tietoa verkkokaupasta
Toimitusehdot
Tietosuojaseloste