Design a dfa for a language l which is given by the

Question

Question 1. Array is given as Auto which records the item's old from 1932 to 1994. The base address of auto array is 200, now give address of 1933 and 1965 and one word store 4 unit off data.

Question 2. L = { aⁿvⁿ : n ≥ 1} design PDA(Push Down Automata) for this?

Question 3. Show that the given language is non regular using pumping lemma where n is an integer.

L = { bⁿ aⁿ | n ≥ 0 }

L = {0ⁿ1ⁿ | n ≥ 0}

L = {1ⁿ0ⁿ | n ≥ 0}

L = {0^_n2 | n ≥ 0}

Question 4. Solve this DFA to get Final regular Expression?

Question 5. Design a DFA for a language L which is given by the expression L = { w : n_a = 1, w ∈ {a, b}*}

Question 6. Design NFA L = (ab(L1) Uaba(L2))*