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 |
| LEADER | 01183nab a2200241 i 4500 | ||
|---|---|---|---|
| 001 | acta12522 | ||
| 005 | 20220613110649.0 | ||
| 008 | 161015s1993 hu o 0|| eng d | ||
| 022 | |a 0324-721X | ||
| 040 | |a SZTE Egyetemi Kiadványok Repozitórium |b hun | ||
| 041 | |a eng | ||
| 100 | 1 | |a Van Do Long | |
| 245 | 1 | 3 | |a On codes concerning bi-infinite words |h [elektronikus dokumentum] / |c Van Do Long |
| 260 | |c 1993 | ||
| 300 | |a 97-109 | ||
| 490 | 0 | |a Acta cybernetica |v 11 No. 1-2 | |
| 520 | 3 | |a 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. | |
| 650 | 4 | |a Természettudományok | |
| 650 | 4 | |a Számítás- és információtudomány | |
| 695 | |a Számítástechnika, Kibernetika | ||
| 700 | 0 | 1 | |a Nguyen Huong Lam |e aut |
| 700 | 0 | 1 | |a Huy Phan Trung |e aut |
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/12522/1/cybernetica_011_numb_001_002_097-109.pdf |z Dokumentum-elérés |