Litovsky Igor: Free submonoids and minimal ω-generators of Rω. In: Acta cybernetica, (10) 1-2. pp. 35-43. (1991)
Preview |
Cikk, tanulmány, mű
cybernetica_010_numb_001_002_035-043.pdf Download (722kB) | Preview |
Abstract
Let A be an alphabet and let R be a language in A+. An (¿-generator of -R" is a language G such that G" = R". The language Stab(-R") = {u G A* : ttiZ" Ç R"} is a submonoid of A*. We give results concerning the wgenerators for the case when Stab(Ru ) is a free submonoid which are not available in the general case. In particular, we prove that every ((»-generator of 22" contains at least one minimal w-generator of R". Furthermore these minimal w-generators are codes. We also characterize the w-languagea having only finite languages as minimal u-generators. Finally, we characterize the w- languages »-generated by finite prefix codes.
| Item Type: | Article |
|---|---|
| Journal or Publication Title: | Acta cybernetica |
| Date: | 1991 |
| Volume: | 10 |
| Number: | 1-2 |
| ISSN: | 0324-721X |
| Page Range: | pp. 35-43 |
| Language: | English |
| Place of Publication: | Szeged |
| Related URLs: | http://acta.bibl.u-szeged.hu/38493/ |
| Uncontrolled Keywords: | Számítástechnika, Kibernetika |
| Additional Information: | Bibliogr.: p. 42-43. ; összefoglalás angol nyelven |
| Subjects: | 01. Natural sciences 01. Natural sciences > 01.02. Computer and information sciences |
| Date Deposited: | 2016. Oct. 15. 12:26 |
| Last Modified: | 2022. Jun. 13. 08:12 |
| URI: | http://acta.bibl.u-szeged.hu/id/eprint/12491 |
Actions (login required)
 |
View Item |
