Ordered fractal semigroups as a model of computation
β Scribed by F.G. Arenas; M.L. Puertas; S. Romaguera
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 709 KB
- Volume
- 36
- Category
- Article
- ISSN
- 0895-7177
No coin nor oath required. For personal study only.
β¦ Synopsis
introduce the notion of an ordered (generalized) fractal semigroup and show that it characterizes ordered non-Archimedean quasi-metric semigroups.
With the help of this characterization, several properties of ordered fractal structures are discussed. Our study is motivated, in great part, by the fact, proved here, that the structure of an ordered non-Archimedean quasi-metric semigroup provides an efficient setting to interpret the properties of several interesting examples of spaces which appear in some fields of theoretical computer science and image processing, respectively.
π SIMILAR VOLUMES
It is well known that the free group on a non-empty set can be totally ordered and, further, that each compatible latttice ordering on a free group is a total ordering. On the other hand, SaitΓ΄ has shown that no non-trivial free inverse semigroup can be totally ordered. In this note we show, however
In the present paper, it is shown that a porous silicon can be presented as a set of clusters of silicon atoms surrounded by SiO , whereas the single crystalline silicon substrate can be considered as an infinite cluster. The formulae for the estimation x Ε½ of variable porosity of the material inclu