Author： Brogi A. Jacquet J.-M.
Publisher： Elsevier
ISSN： 1571-0661
Source： Electronic Notes in Theoretical Computer Science, Vol.16, Iss.2, 2004-01, pp. : 1-22
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Previous Menu Next
Abstract
Related content
The expressiveness of a family of finite set languages
By Immerman N. Patnaik S. Stemple D.
Theoretical Computer Science, Vol. 155, Iss. 1, 1996-02 ,pp. :
Access to resources
Recommend
Information flow for Algol-like languages
Computer Languages, Vol. 28, Iss. 1, 2002-04 ,pp. :
Presheaf models for CCS-like languages
Theoretical Computer Science, Vol. 300, Iss. 1, 2003-05 ,pp. :
By Valiant L.G.
Theoretical Computer Science, Vol. 289, Iss. 1, 2002-10 ,pp. :
Learning power and language expressiveness
By Martin E. Sharma A. Stephan F.
Theoretical Computer Science, Vol. 298, Iss. 2, 2003-04 ,pp. :