Author： Crvenkovic S. Dolinka I.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.289, Iss.1, 2002-10, pp. : 531-551
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
Regular expression for a language without empty word
By Ziadi D.
Theoretical Computer Science, Vol. 163, Iss. 1, 1996-08 ,pp. :
Access to resources
Recommend
Counting the solutions of Presburger equations without enumerating them
Theoretical Computer Science, Vol. 313, Iss. 1, 2004-02 ,pp. :
Axioms for Recursion in Call-by-Value
By Hasegawa M.
LISP and Symbolic Computation, Vol. 15, Iss. 2-3, 2002-09 ,pp. :
By Schobbens P.-Y. Raskin J.-F. Henzinger T.A.
Theoretical Computer Science, Vol. 274, Iss. 1, 2002-03 ,pp. :
Axioms from interactions of actors theory
By Green Nick
Kybernetes: The International Journal of Systems & Cybernetics, Vol. 33, Iss. 9-10, 2004-09 ,pp. :