A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Representing recursively enumerable languages by iterated deletion
2004
Theoretical Computer Science
A characterization of the recursively enumerable languages in terms of the iterated deletion operation is given. This solves two open problems posed by Ito and Silva on the closure properties and decidability of iterated deletion.
doi:10.1016/j.tcs.2004.01.002
fatcat:jrf3wox24vb5lhmahnow2kqg6m