The decidability of a mapping problem fo
โ
Kenneth B. Salomon
๐
Article
๐
1975
๐
Elsevier Science
๐
English
โ 947 KB
The following problem is shown to be decidable for arbitrary regular sets R i and Rz : Does there exist a generalized sequential machine with final states which maps R 1 onto R2 ? In the development of the solution a graphical interpretation of bounded and unbounded regular sets is presented. Also,