Elsevier

Information Processing Letters

Volume 101, Issue 4, 28 February 2007, Pages 139-140
Information Processing Letters

A Kleene characterization of computability

https://doi.org/10.1016/j.ipl.2006.09.003Get rights and content

Abstract

The recursively enumerable binary relations are the smallest class containing all singleton relations and closed under union, concatenation, Kleene star, composition, and transitive closure.

References (8)

There are more references available in the full text version of this article.

Cited by (0)

View full text