retagged by
1,682 views

1 Answer

Best answer
4 votes
4 votes

1) is regular , $(1+2+3+.............+9)^*0+(0+2+3+.............+9)^*1+(0+1+3+.............+9)^*2+...................(0+1+2+3+.............+8)^*9+\epsilon$

NFA of this string contain 12 states.


 Min no of states in eqv DFA = [ ? ]  // If anyone knows, please edit here with logic. 
2)is CSL, The Language generated by the grammer is $w(0+1)^*w$

So, it generates={00,11,0101,01000001...........................}

selected by

Related questions

5 votes
5 votes
3 answers
2
Hirak asked May 25, 2019
1,729 views
Consider the following statements:$S_1:\{(a^n)^m|n\leq m\geq0\}$$S_2:\{a^nb^n|n\geq 1\} \cup \{a^nb^m|n \geq1,m \geq 1\} $Which of the following is regular?$S_1$ only$S_2...