Question: Let us consider ternary numbers with alphabet = { 0 , 1 , 2 , # } , where # is used as a delimiter.

Let us consider ternary numbers with alphabet ={0,1,2,#},where # is used as a delimiter. Then define language A as:
A ={x#y : x,y in {0,1,2}+and 2x =y}
In this case, 0#0000 in A and 12#101 in A,but 11#110not in A.
Show that A is decidable by constructing an appropriate Turing machine using pseudo code.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!