Characterizations for the regular prefix codes and related families |
| |
| Authors: | Paulo A S Veloso |
| |
| Affiliation: | (1) Departamento de Informatica, Pontificia Universidade Catolica, 22.453 Rio de Janeiro, RJ, Brazil |
| |
| Abstract: | Intrinsic characterizations by means of analogues of regular expressions are given for six families of regular languages related to the prefix codes, namely their reversals and their closure under union, the right and left ideals, and their complements. First, a characterization for the regular prefix codes is obtained, which is then used to characterize the other families. Characterizations by finite automata are also presented.This research has been sponsored in part by FINEP, CNPq and Canadian NRC. |
| |
| Keywords: | Prefix code regular expression regular language finite automaton operations on languages closure properties |
| 本文献已被 SpringerLink 等数据库收录！ |
|
