**Turing machine for the language of all those string in which a is less than b, a**^{m}b^{n, } where a<b

^{m}b

^{n, }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.

**Figure:** Turing machine for a is less than b

Latest posts by Prof. Fazal Rehman Shamil (see all)

- List of Public service commissions - August 31, 2020
- Comparison of fee structure of Pakistani Universities - June 1, 2020
- Past Guess Paper of Auditing - May 12, 2020