Author： D. Perrin Zhang L. Shen Z.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.145, Iss.1, 1995-07, pp. : 345-355
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
Theoretical Computer Science, Vol. 218, Iss. 1, 1999-04 ,pp. :
Access to resources
Recommend
Hajos factorizations and completion of codes
By Nguyen H.L.
Theoretical Computer Science, Vol. 182, Iss. 1, 1997-08 ,pp. :
Completion of codes with finite bi-decoding delays
By Zhang L. Shum K.P. Peng S.-L.
Theoretical Computer Science, Vol. 306, Iss. 1, 2003-09 ,pp. :
Recognizable languages in concurrency monoids
By Droste M.
Theoretical Computer Science, Vol. 150, Iss. 1, 1995-10 ,pp. :
Some properties of recognizable Z-subsets
By Kobayashi N.
Theoretical Computer Science, Vol. 293, Iss. 1, 2003-02 ,pp. :