Some combinatorial properties of infinite words and applications to semigroup theory
โ Scribed by Giuseppe Pirillo; Stefano Varricchio
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 560 KB
- Volume
- 153
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
This paper is concerned with finiteness conditions for finitely generated semigroups. First, we present a combinatorial result on infinite sequences from which an alternative proof of a theorem of Restivo and Reutenauer follows: a finitely generated semigroup is finite if and only if it is periodic and permutable. Then, generalizing notions studied in some papers of de Luca, Restivo, Hashiguchi and Varricchio, we introduce the notion of co-iteration property and we prove that a finitely generated semigroup has the ~-iteration property if and only if it is finite.
๐ SIMILAR VOLUMES
For a \(C_{14}\)-semigroup \(T(\cdot)\), we prove a general multiplicative perturbation theorem which subsumes many known multiplicative and additive perturbation theorems, and provides a general framework for systematic study of the perturbation associated with a step response \(U(\cdot)\) of a lin
## Corporation This article considers multi-stage processes composed of a sequence of operations in which the outcome of the preceding operations may be used to guide the course of future operations. Examples of such processes can be found in many fields including industrial production, military p