Author： Ambos-Spies K. Merkle W. Reimann J. Terwijn S.A.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.306, Iss.1, 2003-09, pp. : 177-194
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
Locally complete sets and finite decomposable codes
By Neraud
Theoretical Computer Science, Vol. 273, Iss. 1, 2002-02 ,pp. :
Access to resources
Recommend
Probably Almost Discriminative Learning
By Yamanishi K.
Machine Learning, Vol. 18, Iss. 1, 1995-01 ,pp. :
Algorithmica, Vol. 63, Iss. 1-2, 2012-06 ,pp. :
More on morphisms and almost-periodicity
By Maes A.
Theoretical Computer Science, Vol. 231, Iss. 2, 2000-01 ,pp. :
By Muchnik A. Semenov A. Ushakov M.
Theoretical Computer Science, Vol. 304, Iss. 1, 2003-07 ,pp. :