omega -orbit finite automata for data compression
Y. Liu, H. Ma · 2002
omega -orbit finite automata ( omega -OFA) are introduced to develop more efficient and powerful data compression techniques. Barnsley's iterated function systems (IFS) define an image as an attractor. Regulator set plotters (RSP) interpret a regular language as an image. These two techniques can be unified into one more powerful system. omega -OFA are more powerful than RSP and IFS in image generation and the efficiency of data compression for omega -OFA is equally good. The authors prove that the class of images defined by IFS and that defined by RSP partially overlap and the union of these is a proper subset of the class defined by omega -OFA.>