Author： Bruyere V. Perrin D.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.218, Iss.1, 1999-04, pp. : 107-121
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Completion of recognizable bifix codes
Theoretical Computer Science, Vol. 145, Iss. 1, 1995-07 ,pp. :
Access to resources
Recommend
By Lam N.H.
Theoretical Computer Science, Vol. 262, Iss. 1, 2001-07 ,pp. :
By Guesnet Y.
Theoretical Computer Science, Vol. 307, Iss. 1, 2003-09 ,pp. :
On maximal codes with bounded synchronization delay
By Bruyere V.
Theoretical Computer Science, Vol. 204, Iss. 1, 1998-09 ,pp. :
On maximal codes with a finite interpreting delay
By Guesnet Y.
Theoretical Computer Science, Vol. 273, Iss. 1, 2002-02 ,pp. :