CRN Elimination and Substitution Bases for Complexity Classes
Stefano Mazzanti · Fundamenta Informaticae · 2012
Function classes closed with respect to substitution and concatenation recursion on notation are characterized as the substitution closure of finite function sets. Consequently, the sets of TC 0 , NC 1 and L computable functions are characterized as the substitution closure of a finite function set.