Computer Science Asked by ocram on November 17, 2021
I’ve this exercise of which I’m not very sure about my solution.
Exercise:
Define the transition table about a Turing Machine that accepts words
on the {a, b} alphabet where each a is followed by only two b.
My proposed solution is:
(f stands for transition function)
I came up with this after thinking in the same way as finite state machines, even if I know are different with respect to Turing Machines (no tape, no reading/writing symbols and no right/left moves).
So, my question is, which is the best way of reasoning when I have to solve these kinds of problems?
Thank for your attention!
Answered by Andres on November 17, 2021
There isn't really a "best way of reasoning". Mathematical proof is essentially a creative act and there isn't a straightforward recipe you can follow. I usually find it helps to treat Turing machine construction as a programming problem, which is basically what it is.
Answered by David Richerby on November 17, 2021
Get help from others!
Recent Questions
Recent Answers
© 2024 TransWikia.com. All rights reserved. Sites we Love: PCI Database, UKBizDB, Menu Kuliner, Sharing RPP