Write a TM (Turing Machine) program that adds two base two numbers. Input is two nonnegative integers in base 2 with a plus sign between them. Output is their sum in base 2, with nothing else left on the tape. So first decrement, then increment.
Use the following language for the program:
current state, read symbol, next state, write symbol, direction [directions are (< left, > right, s stay)]
Here's an example program:
1,B,2,#,>
2,B,2,B,>
2,X,2,X,>
2,_,3,X,>
3,_,4,X,>
4,_,5,X,<
5,X,5,X,<
5,B,6,B,<
5,#,9,_,>
6,B,6,B,<
6,#,1,_,>
9,X,10,A,>
10,X,11,B,>
11,X,9,C,>
9,_,H,_,<
this is the turing machine.
the down examples i didnt understand please tell me once again i
can explain

Write a TM (Turing Machine) program that adds two base two numbers. Input is two nonnegative...
Write a TM (Turing Machine) program that adds two base two numbers. Input is two nonnegative integers in base 2 with a plus sign between them. Output is their sum in base 2, with nothing else left on the tape. So first decrement, then increment. Use an online Turing Machine Simulator to see how it works. Use the following language for the program: current state, read symbol, next state, write symbol, direction [directions are (< left, > right, s stay)]...
rarisition written in the format of the Turing Machine simulator is a special state H which means halt. For the given Below is a Turing machine program where each line is a transition writen current state, read symbol, new state, write symbol, drection e-d. wmeans to state 4, write a 1 and move the tape head left. Notc there is a special state a os on the leftmost n nanks , write the resulting bitstring when the TM reaches the...
Give an informal description (in plain English) of a Turing machine with three tapes that receives as input two non-negative integers x and y, and returns as output the integer xy. Integers are represented as binary strings.Start of the computation: The first tape contains the binary representation of x and its head is on the rightmost symbol of x. The second tape contains the binary representation of y and its head is on the rightmost symbol of y. The third...
3.(4 4+20-36 points Formal Definition of a Turing Machine (TM) ATM M is expressed as a 7-tuple (Q, T, B, ? ?, q0,B,F) where: . Q is a finite set of states T is the tape alphabet (symbols which can be written on Tape) .B is blank symbol (every cell is filled with B except input alphabet initially .2 is the input alphabet (symbols which are part of input alphabet) is a transition function which maps QxTQxTx (L, R :...
1) Write a TM program to sort a nonempty string of A's and B. Assume the tape head starts on the leftmost character. For example if the tape contains BAABABB to start with, then when the machine halts AAABBBB will be left on the tape. Machine will be in the halt state (H) when done with tape head on the first nonblank character. Please give me a code
. Please design a standard TM (i.e., a single semi-infinite tape, deterministic) for the laın guage of all palindromes over alphabet {a, b} . Please give both the high-level description (text description or pseudo-code algorithm) and the low-level state transition diagram. Please analyze how many steps (one transition is considered as a step) it takes to accept an input palindrome with n symbols . Please design a deterministic Turing machine with two semi-infinite tapes for the same language. Please give...
how to solve this problem
COMPSCI 110 37. Consider the following instruction set for a Turing machine (1,0,1,2,R) (1,1,1,1,R) (2,0, 1, 4, R) (2,1,1, 3, R) (3,0,1,5,R) (3,1,0,1,R) (4,0,0,2,R) (4,1,1,4,R) (5,0,1,2,R) (5,1,1,5, R) If the Turing machine is run on the tape 011001..., starting in statel on the first symbol on left of the tape, which state does it end up in after executing 6 instructions? A. State 5 B. State 2 C. State 4 D. State 3 E. State...
Code in assembly language please
"Write an assembly 32 bit program that adds two numbers (other than 5 and 6) and stores the value to a variable called 'sum'. Also, use a block COMMENT to depict the name and description of the program, author of the program, and date."
5. Design a Turing machine that takes as input two numbers a and b, such that a is not equal to b and determines which number is higher. Give the transition table for the machine. Show by drawing the steps, how the machine works when a-3 and b-2. Can we use a PDA for the same problem? Give reasons for your answer (10+5+5-20).
Please write MIPS program that runs in QtSpim (ex: MipsFile.s) Write a MIPS program that will read in a base (as an integer) and a value (nonnegative integer but as an ASCII string) in that base and print out the decimal value; you must implement a function (which accepts a base and an address for a string as parameters, and returns the value) and call the function from the main program. The base will be given in decimal and will...