| Research>>> Acta Cybernetica>>> Previous Volumes>>> | Magyarul |
On codes concerning bi-infinite words
Do Long Van
Nguyen Huong LamPhan Trung Huy
Abstract:
In this paper we consider a subclass of
circular codes called 
-codes. Some tests of
Sardinas-Patterson type for -codes are given when they are
finite or regular languages. As consequences, we prove again
the results of Beal and Restivo, relating regular
-codes
to circular codes and codes with finite synchronization
delay. Also, we describe the structure of two-element
-codes.
Gyenizse Pal 1996. Szeptember 4. Szerda 13:31:03 MET DST