The decidability of a mapping problem for generalized sequential machines with final states

  • Authors:

  • Kenneth B. Salomon

  • Affiliations:

  • -

  • Venue:
  • Journal of Computer and System Sciences
  • Year:
  • 1975

Quantified Score

Hi-index 0.00

Visualization

Abstract

The following problem is shown to be decidable for arbitrary regular sets R"1 and R"2: Does there exist a generalized sequential machine with final states which maps R"1 onto R"2? In the development of the solution a graphical interpretation of bounded and unbounded regular sets is presented. Also, the subproblem when R"1 and R"2 are arbitrary bounded regular sets is shown to be decidable.