CRN Elimination and Substitution Bases for Complexity Classes

  • Authors:

  • Stefano Mazzanti

  • Affiliations:

  • (Correspd.) Facoltà di Design e Arti, Università Iuav di Venezia, Fondamenta delle Terese 2206, 30123 Venezia, Italy, mazzanti@iuav.it

  • Venue:
  • Fundamenta Informaticae
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 TC0, NC1 and L computable functions are characterized as the substitution closure of a finite function set.