I have a lot of difficulty with the turing machines. I understand the theory well, but I need help with a lab exercise...

Design a SINGLE TAPE Turing Machine that accepts the language $a = > b \times c$ (or $1^{^{mn}}= 1^{^{m}} \times 1^{^{n}} )$, this means that this language only accepts unary multiplications.

Some examples are :

  • 1111=11x11 is accepted

  • 1=1x1 is accepted

  • 111111=11x111 is accepted

  • 11x1 is not accepted

  • 11111=1111x11 is not accepted

The order with the result in front is imperative. The input is accepted only if the calculation is correct (we dont need to check the pattern).

I search help for drawing this Turing machine…

Thanks you for your help...

  • $\begingroup$ Have you experimented with some online Turing machine simulator such as this one? $\endgroup$
    – John L.
    Oct 25 '21 at 22:46
  • $\begingroup$ Yes @JohnL. but I need help to draw this machine... $\endgroup$
    – XynaJs
    Oct 26 '21 at 8:34
  • $\begingroup$ Suppose $m$ is fixed to be $1$. Can you design that machine? $\endgroup$
    – John L.
    Oct 26 '21 at 8:50

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.