Regular expression (x+y)(x+y) denotes the set
a. xy,yx
b. xx,xy,уx,yy
c. x,y
d. x,y,xy
Which of the following strings do not belong the given
regular expression? (a)*(a+cba)
a) aa
b) aaa
c) acba
d) acbacba
The set of all strings over (a, b) of length 4. starting with an
a is represented by the regular expression
a) a(a + b)*
b) a(ab)*
c) (ab + ba) (aa + bb)
d) a(a + b)(a + b) (a + b)
What is the second step in removing null moves between 2
vertices(v1 and v2
a) copy all transitions from v1 to v2
b) remove null move directly
c) Make v1 as initial state
d) none
If language is(aa,aaaa,aaaaaa……………then what will be
the regular expression
a) (aa)*
b) (a)+
c) (aa)+
d) a*
(0*1*)* is the same as
a) (0 + 1)*
b) (01)*
c) (10)*
d) none of these
The set of all strings over (a, b) of even length is
represented by the regular expression
a) (ab + aa + bb + ba)*
b) (a + b)*(a* + b)*
c) (aa + bb)*
d) (ab + ba)*
What is the Last step in removing mull moves between 2
vertices(v1 and 12)
a) copy all transitions from v1 to v2
b) remove mull move directly
c) Make v1 as final state if v2 is final state
d) none
find the regular expression for
a^mb²^nc³p
where m.n.p >=1
a) aa*bb*cc*
b) aa*b*c*
c) aa*(bb)(bb)*ccc(ccc)*
d) none of these
Recognize the regular expression corresponding to the
following Finite Automata using Arden's Method
treat ql as initial state
a) 0*1*+0*
b) (0 + 1)*
c) (1101)*
d) (0 + 11 + 010)*
if the language is containing strings- ac, abc, abbc,.....then
what will be the regular expression.
a) ab*c
b) a*bc
c) a*b*c
d) abc*
what will be the regular expression for language in which
of all strings containing exactly 2a's.
a) ab*ab*
b) b*ab*ab*
c) (a+b)*aa(a+b)*
d) none of these
Find the pair of regular expressions that are equivalent
a. (0+1)* and (0*+1*)*
b. (0+1)* and (0+1*)*
c (0+10)* and (0*+10)*
d. All of the mentioned
By using Arden's Theorem, the equation q1 = q1 (ab + ba)
+ ^ can be written as,
a) q1= (a+b)*
b) q1= (abba)*
c) q1 = (ab)*
d) q1= (ab+ba)*
The regular expression with all strings of 0's and 1's with
at least two consecutive's is:
a) 1 + (10)*
b) (0+1)*00(0+1)*
c) (0+1)*011
d) 0*1*2*