Abstract: Sets of codewords can be represented by finite automata (FAs) and every FA can be represented by connection matrices or regular expressions. Our goal is to find similar systems like that and to solve one of the systems's problems in another system. Having a set of codewords we have to decide whether there are two or more sequences of codewords which form the same chain of characters of codewords. We have developed an algorithm that solves this problem by using finite automata and their deterministic finite automata.
Keywords: Uniquely decipherable codes, automata, length-variable codes.
Classification (MSC2000): 94B35; 94A45, 68Q45
Full text of the article: