| 书目名称 | Finiteness and Regularity in Semigroups and Formal Languages |
| 编辑 | Aldo Luca,Stefano Varricchio |
| 视频video | |
| 概述 | Rigorous presentation of latest research results A unique and definitive monograph on a central subject in theoretical computer science with various applications.A must for all experts in theoretical |
| 丛书名称 | 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. Henc |
| 出版日期 | Book 1999 |
| 关键词 | Monoid; algebra; combinatorics; combinatorics on word; combinatorics on words; computer science; finitenes |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-642-59849-4 |
| isbn_softcover | 978-3-642-64150-3 |
| isbn_ebook | 978-3-642-59849-4Series ISSN 1431-2654 Series E-ISSN 2193-2069 |
| issn_series | 1431-2654 |
| copyright | Springer-Verlag Berlin Heidelberg 1999 |
发表于 2025-3-21 18:32:27
