On maximal codes with a finite interpreting delay

Yannick Guesnet
2002 Theoretical Computer Science  
The notion of codes with a ÿnite interpreting delay (f.i.d.) was introduced in (Guesnet, Theoret. Inform. Appl. 34 (2000) 47-59) . In this paper, we are interested in the notion of maximality for f.i.d. codes. We characterize the maximal f.i.d. codes in terms of completeness. We also present an embedding procedure keeping thinness, rationality and the delay.
doi:10.1016/s0304-3975(00)00439-4 fatcat:olefkzblivcetm6f6c4z44drem