Solvability of Machine Mappings of Regular Sets to Regular Sets
Seymour Ginsburg, Thomas Nathaniel Hibbard · Journal of the ACM · 1964
Each of the following three problems is shown to be recursively solvable for arbitrary regular sets U and V. (1) Does there exist a complete sequential machine which maps U into V? (2) Does there exist a generalized sequential machine which maps U i~to V so that the image of U is infinite if U is infinite?(3) Does there exist a complete seque~tial machine which maps U onto V?