1.

design NFA for RE:(ab/ba)*/(aa/bb)*

2. Diff betn NFA and DFA
3. diff betn moore mc and mealy mc
4. design mealy mc for re (0+1)*(00+11)
5. design fsm for decimal no divisible by 4

not exact answer but a reference

1discuss decision properties of regular language
2. discuss closure properties of regular language
3 prove using pumping lemma thm L{a^ib^2i | i>=1} is not a reg language
4 using pumping lemma thm pt language L={a^mb^m|m>=1}is not a reg language
1 for a given grammar g{v,t,p,s where p: S-> aAs/a
A-> SbA/SS/ba
derive w=aabbaa using lmd,rmd
2. for a given grammar G: having prodn rule as G:S->iC+S/iC+SeS/a
for a string w=ib+ib+aea find rmd lmd and parsing tree
3 explain chomsky hierarchy
4. write a grammar for string w=aaaa using sentinal form

(refer chatgpt mera to crash hogaya)

btw answer shayad S -> a S -> a S -> a S -> a S hai
5. explain cnf with suitable example
6 explain gnf using suitable example