- Full text PDF available (5)
- This year (0)
- Last 5 years (0)
- Last 10 years (2)
Journals and Conferences
We describe a new elementary reduction of two-way automata to one-way automata. The reduction is based on the subset construction rather than on crossing sequence analysis.
As a result of the work of Turing, Post, Kleene and Church [1, 2, 3, 9, 10, l l 12, 17, 18] it is now widely accepted ~ that the concept of "computable" as applied to a function ~ of natural numbers is correctly identified with the concept of "partial recursive." One half of this equivalence, that all functions computable by any finite, discrete,… (More)
The classic results of logic programming are based on an underlying equality relation of syntactic identity. Jaffar, Lassez and Maher  have shown how to extend these results, for definite clause programs, to other equality relations. We continue their development by showing how to deal with programs have negative literals in the bodies of clauses. We… (More)