Design the Turing Machine which accepts the language which contains the strings of number of a’s more than number of b’s over alphabet, Z: = {a, b}. Create a test string (minimum of 8 alphabets) and run the string on it.
Answers
Answer:
hi
Explanation:
watch the video I have attached
Answer:
Turing Machine was invented by Alan Turing in 1936 and it is used to accept Recursive Enumerable Languages (generated by Type-0 Grammar).
A turing machine consists of a tape of infinite length on which read and writes operation can be performed. The tape consists of infinite cells on which each cell either contains input symbol or a special symbol called blank. It also consists of a head pointer which points to cell currently being read and it can move in both directions.
Explanation:
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)
∑ is the input alphabet (symbols which are part of input alphabet)
δ is a transition function which maps Q × T → Q × T × {L,R}. Depending on its present state and present tape alphabet (pointed by head pointer), it will move to new state, change the tape symbol (may or may not) and move head pointer to either left or right.
q0 is the initial state
F is the set of final states. If any state of F is reached, input string is accepted.
Let us construct a turing machine for L={0^n1^n|n>=1}
