Wyniki wyszukiwania - BazTech

Ograniczanie wyników

2 Fundamenta Informaticae

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Characterization Results for Time-Varying Codes

Tiplea F.L., Mäkinen E., Trinca D., Enea C.

Fundamenta Informaticae

2002

Vol. 53, nr 2

185-198

Time-varying codes associate variable length code words to letters being encoded depending on their positions in the input string. These codes have been introduced in [8] as a proper extension of L codes. This paper is devoted to a further study of time-varying codes. First, we show that adaptive Huffman encodings are special cases of encodings by time-varying codes. Then, we focus on three kinds of characterization results: characterization results based on decompositions over families of sets of words, a Schützenberger like criterion, and a Sardinas-Patterson like characterization theorem. All of them extend the corresponding characterization results known for classical variable length codes.

A note on SE-Systems and regular canonical systems

Tiplea F.L., Mäkinen E.

Fundamenta Informaticae

2001

Vol. 46, nr 3

253-256

A synchronized extension system is a 4-tuple G = (V,L1,L2,S), where V is an alphabet and L1, L2 and S are languages over V. Such systems generate languages extending L1 by L2 to the left or to the right, and synchronizing on words in S. In this note we consider the relationship between synchronized extension systems and regular canonical systems. We are able to give a simplified and generalized proof for the classical result concerning the regularity of the languages defined by regular canonical systems.