- Full text PDF available (5)
- This year (0)
- Last 5 years (0)
- Last 10 years (2)
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.
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, deterministic device supplied with unlimited storage are partial recursive, is relatively… (More)
Can one extend crisp Peano arithmetic PA by a possibly many-valued predicate Tr(x) saying \x is true" and satisfying the \dequotation schema" ' Tr(') for all sentences '? This problem is investigated in the frame of Lukasiewicz innnitely valued logic.