Some properties of recognizable Z-subsets
β Scribed by Nami Kobayashi
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 288 KB
- Volume
- 293
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
β¦ Synopsis
We study some properties of recognizable Z-subsets of A * and its subfamilies: the simple Z-subsets, the limited Z-subsets, the recognizable M-subsets, the simple M-subsets and the M-subsets which are nondeterministic complexities of ΓΏnite automata. At ΓΏrst, we study some necessary conditions for membership in each one of these families and after we investigate the closure properties of these families under several operations. We also study the relations existing among some subfamilies of recognizable M-subsets and the families Hp (p ΒΏ 0) obtained by Simon.
π SIMILAR VOLUMES
The plactic monoid %(a, b) on two letters will be studied from the point of view of classical language theory. In particular, we will give the fine structure of its recognizable subsets. @ 1997 Elsevier Science B.V.
A basic system k a nonempty collection of finite incomparable subsets of a set such that for any two subsets or bases in the collection, any flement of one basis can be replaced by some element of the other to give another basis in the collection. In a basic system, any subset of one basis can be bi