ASSIGNMENT I:

1. Find R* for the relation R = {(1, 1), (1, 2), (2, 1), (2, 3), (3, 2)} over set S = {1, 2, 3}

2. Prove by principle of induction:

If f(2) = 2 and f(2k) = 2f(2k-1) +3, then f(2k) = 5/2.2k - 3

3. Check the validity of the following argument:

If Ram has completed B. Tech. Computer Science or MBA, then he is

assured of a good job. If Ram is assured of a good job, he is happy. Ram is not happy.
So Ram has not completed MBA.

ASSIGNMENT II:

1. Prove the following identities:

(a*ab + ba)*a* = (a + ab + ba)*

2. Construct a DFA equivalent to NFA given in figure 2.8 (R1)

3. Construct a grammar that generates all even integers up to 998.

4. Construct a FA accepting regular expression (a+b)*abb.

5. Find a regular grammar accepting the set recognized by the finite automation
given in Figure 4.32(C) (R1)

6. Construct a DFA equivalent to the grammar:

S → aS | bS | aA, A → bB, B → aC, C → ʌ.

ASSIGNMENT III:

1. Construct the parse tree for the given production generating string aaabbabbba, S
→ aB | bA, A → aS | bAA | a, B → bS | aBB | b.

2. Construct a CNF for the grammar: S → 1A | 0B, A → 1AA | 0S | 0, B → 0BB | 1S |

1.

3. Construct a GNF for generating set of all strings over {a, b} consisting of
equal number of a’s and b’s.

ASSIGNMENT IV:

1. Construct a PDA accepting by empty store of the L = {anbman | m, n ≥ 1}.

2. Construct a CFG generating L(G) = { anbmcmdn| m, n ≥ 1}.