722 views

4 Answers

1 votes
1 votes
Find the smallest length string and then proceed in lexicographic ordering...find out first 3 or 4 string of the language....then compare with the options....if any of the strings is present in the option, it will be discarded
1 votes
1 votes
If we try to write the regular expression of the language accepted by above NFA,it looks something like :

$\epsilon + 01^{*} + (01)^{*}$

From the above expression we can say that language L(M) accepts all strings starting with zero or the null string.Or, equivalently in set-builder notation:

$L(M)=\left \{ w:w\epsilon (\left \{ 0,1 \right \}^{*}\wedge {w} \ starts\ with\ zero \vee it's\ a\ null\ string) \right \}$

$\sim L(M)=\left \{ w: w \in \left \{ 0,1 \right \}^{*}\wedge w\ starts\ with\ 1 \right \}$

$So,regex(\sim L(M))=1(0+1)^{*}$
0 votes
0 votes
The NFA represents the null string, starts with 0 and followed by anything so compliments is nothing but 1 followed by anything.

Related questions

0 votes
0 votes
1 answer
1
2 votes
2 votes
2 answers
3
Kapil asked Jul 8, 2016
1,343 views
The equality of two regular expression is computed in? Give reasons also..Constant Timepolynomial timelogarithmic Polynomial timeExponential time
1 votes
1 votes
2 answers
4
shekhar chauhan asked Jun 8, 2016
1,754 views
If r1 and r2 are 2 Regular Expression Such thatr1 = (a+b)* r2 = (a*+b*+a*b*+b*a*)What are the different case's in which r1 = r2 ?Please Explain with an example