Turing machine for the language of all those string in which a is less than b in Theory of automata

By: Prof. Fazal Rehman Shamil
Last modified on January 25th, 2021

Turing machine for the language of all those string in which a is less than b, ambn,  where a<b

Explanation of diagram:

Start:

Start of machine operation

From start, there is a,x,r

Read a, write X, move right

From state 2, read a, write a and move right or read Y, write Y, move right.

From state 2, Read B, Write Y, write Y and move right.

Halt state:

Halt state is the ending state.

 

 

ambn where a is not equal to b

Figure: Turing machine for a is less than b

Turing Machine a is Smaller than b
Turing Machine a is Smaller than b

Read More Examples of Turing Machine

  1. Turing Machine to copy a string: with animations
  2. Turing Machine of numbers divisible by 3: with animations
  3. Turing machine for anbncn: with animations
  4. Turing machine of two equal binary strings: with animations

  5. Turing Machine to Accepts palindromes: with animations

  6. Turing machine for a’s followed by b’s then c’s where the number of a’s multiplied by the number of b’s and equals to the number of c’s: with animations

  7. Turing machine to Add two binary numbers: with animations

  8. Turing machine to  Multiply two unary numbers: with animations
  9. Turing machine to Multiply two binary numbers: with animations
  10. Turing Machine for the complement of a string
  11. Turing Machine for the language of anbn where a=b.
  12. Turing Machine for a is less than b, ambn where a=b or m=n.
  13. Turing machine for the language of all those string in which a is less than b