Author: David R.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.300, Iss.1, 2003-05, pp. : 477-504
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
On the asymptotic behaviour of primitive recursive algorithms
By David R.
Theoretical Computer Science, Vol. 266, Iss. 1, 2001-09 ,pp. :
On primitive recursive algorithms and the greatest common divisor function
Theoretical Computer Science, Vol. 301, Iss. 1, 2003-05 ,pp. :
Makanin's algorithm is not primitive recursive
Theoretical Computer Science, Vol. 191, Iss. 1, 1998-01 ,pp. :
Completeness Results for Recursive Data Bases
Journal of Computer and System Sciences, Vol. 52, Iss. 3, 1996-06 ,pp. :
Decidability results for Watson-Crick D0L systems with nonregular triggers
By Honkala J.
Theoretical Computer Science, Vol. 302, Iss. 1, 2003-06 ,pp. :