On codes concerning bi-infinite words
In this paper we consider a subclass of circular codes called Z-codes. Some tests of Sardinas-Patterson type for Z-codes are given when they are finite , or regular languages. As consequences, we prove again the results of Beal and Restivo, relating regular Z-codes to circular codes and codes with f...
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
1993
|
| Sorozat: | Acta cybernetica
11 No. 1-2 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12522 |
| Tartalmi kivonat: | In this paper we consider a subclass of circular codes called Z-codes. Some tests of Sardinas-Patterson type for Z-codes are given when they are finite , or regular languages. As consequences, we prove again the results of Beal and Restivo, relating regular Z-codes to circular codes and codes with finite synchronization delay. Also, we describe the structure of two-element Zcodes. |
|---|---|
| Terjedelem/Fizikai jellemzők: | 97-109 |
| ISSN: | 0324-721X |