[英]Building Turing machine graph
I have been trying making a Turing machine graph recognizing the language:我一直在尝试制作识别语言的图灵机图:
{(ab)^n(ba)^n | n >0}
How to build the Turing machine graph for the above-mentioned language?如何为上述语言构建图灵机图?
I'll leave defining states as an exercise but if you need help with that I can revisit this answer later.我将定义状态作为练习,但如果您需要帮助,我可以稍后重新访问此答案。 As a hint - you will need either one or a couple of states to handle each of the above steps.
作为提示 - 您将需要一个或几个状态来处理上述每个步骤。
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.