Automata Accepting Bifix Codes
Zheng-Zhu Li, H. J. Shyr, Yen-Shung Tsai · Universitätsbibliothek Gießen · 2008
Automata theory plays a very important role in the field of computer science. A language accepted by an automaton has been called a regular language in a standard way. Bifix codes are very important and useful codes in the whole code theory. The family of bifix codes have been divided into subfamilies such as comma codes, comma- free codes and strict intercodes of index $m \geq 2$. In this paper we investigate the automata which accept variety of bifix codes. The language accepted by an automaton with one or two states can never be a prefix code or a suffix code. We obtained characterizations of an automaton with more than two states which accepted a prefix code and a suffix code. Many characterizations on automata with different number of states which accept different types of codes, such as bifix codes, infix codes, comma codes and comma-free codes were nicely presented in this paper.