On regularity of languages generated by copying systems
β Scribed by A. Ehrenfeucht; G. Rozenberg
- Publisher
- Elsevier Science
- Year
- 1984
- Tongue
- English
- Weight
- 304 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Then the entropy decreases strictly: ent(L W ) Β‘ ent(L). In this note we present a new proof of this fact, based on a method of Gromov, which avoids the Perron-Frobenius theory. This result applies to the regular languages of ΓΏnitely generated free groups and an additional application is presented.
We introduce the notion of subquadrangle regular system of a generalized quadrangle. A subquadrangle regular system of order m on a generalized quadrangle of order (s, t) is a set R of embedded subquadrangles with the property that every point lies on exactly m subquadrangles of R. If m is one half