a) Define through recursive definition , The language L of strings that start and end with different latters and also must contain aa in middle of each string, defined over Σ={a,b,c}. also Write at least 2 Valid and 2 Invalid strings belongs to this language (2+2) (b) Write the Regular expression for the language which accept no pair of consecutive a’s over Σ ={a,b} (1+1+1) i.R.E= ______________ (1) ii.3 Valid strings= _______________(1) iii.3 Invalid strings= _________________(1) (c) Construct a DFA which accepts all strings over Σ ={a,b} in which second last symbol is a and last symbol is b. also Write at least 2 Valid and 2 Invalid strings for the designed DFA.
|
Q.No.3 (a) Define through recursive definition , The language L of strings that start and end with different latters and also must contain aa in middle of each string, defined over Σ={a,b,c}. also Write at least 2 Valid and 2 Invalid strings belongs to this language (2+2)
(b) Write the Regular expression for the language which accept no pair of consecutive a’s over Σ ={a,b} (1+1+1) i.R.E= ______________ (1) ii.3 Valid strings= _______________(1) iii.3 Invalid strings= _________________(1) |
(c) Construct a DFA which accepts all strings over Σ ={a,b} in which second last symbol is a and last symbol is b. also Write at least 2 Valid and 2 Invalid strings for the designed DFA.
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
