Abstract

AbstractA two‐sorted term system characterizing NC implicitly is described. The term system is defined over the tree algebra 𝕋, the free algebra generated by 0, 1 and ∗︁, and the recursion scheme uses pointers over tier 0. This differs from previous characterizations of NC, where tier 1 pointers were used or full parameter substitution over tier 0 was allowed. (© 2003 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call