Register

Recent questions tagged regular-expression

2 votes
1 answer
92
Peter Linz Exercise 3.2 Question 2
Find a NFA that accepts the complement of the language (ab*aa + bba*ab)
Find a NFA that accepts the complement of the language (ab*aa + bba*ab)
User Avatar
2 votes
1 answer
94
NPTEL Assignment Question
A regular expression for accepting strings with exactly one $1$ more than $0$’s is $0^{\ast}1$ $(0|1)^{\ast}1(0|1)^{\ast}$ $(0|1)^{\ast}1(0|1)^{\ast}|1(0|1)^{\ast}$ Not possible
A regular expression for accepting strings with exactly one $1$ more than $0$’s is$0^{\ast}1$$(0|1)^{\ast}1(0|1)^{\ast}$$(0|1)^{\ast}1(0|1)^{\ast}|1(0|1)^{\ast}$Not pos...
User Avatar
1 votes
1 answer
95
#self doubt
What will be the answer
What will be the answer
User Avatar
2 votes
3 answers
96
Regular expressons
The minimum number of states in an equivalent finite automata for the given regular expression are _____ (a(a(a(a(a(ab)*b)*b)*b)*b)*b)*
The minimum number of states in an equivalent finite automata for the given regular expression are _____(a(a(a(a(a(ab)*b)*b)*b)*b)*b)*
User Avatar
2 votes
2 answers
97
KTU University Exam 2021
Let r1=(0+1)*, r2=0*1+10*+0*+1*. What is the length of the smallest string that is present in language corresponds to regular expression r1 and not present in language corresponds to regular expression r2. 2 3 1 none of the above
Let r1=(0+1)*, r2=0*1+10*+0*+1*. What is the length of the smallest string that is present in language corresponds to regular expression r1 and not present in language co...
User Avatar
1 votes
2 answers
98
TIFR CSE 2021 | Part B | Question: 7
Which of the following regular expressions defines a language that is different from the other choices? $b^{\ast }\left ( a+b \right )^\ast a\left ( a+b \right )^ \ast ab^\ast \left ( a+b \right )^{\ast }$ ...
Which of the following regular expressions defines a language that is different from the other choices?$b^{\ast }\left ( a+b \right )^\ast a\left ( a+b \right )^ \ast ab^...
User Avatar
2 votes
2 answers
101
UGC NET CSE | October 2020 | Part 2 | Question: 79
Consider the following regular expressions: $r=a(b+a)^*$ $s=a(a+b)^*$ $t=aa^*b$ ... $L(r) \supseteq L(t) \supseteq L(s)$ $L(s) \supseteq L(t) \supseteq L(r)$
Consider the following regular expressions:$r=a(b+a)^*$$s=a(a+b)^*$$t=aa^*b$Choose the correct answer from the options given below based on the relation between the langu...
User Avatar
1 votes
3 answers
102
NIELIT 2016 MAR Scientist C - Section C: 17
Regular expression $(a \mid b)(a \mid b)$ denotes the set $\{a,b,ab,aa\}$ $\{a,b,ba,bb\}$ $\{a,b\}$ $\{aa,ab,ba,bb\}$
Regular expression $(a \mid b)(a \mid b)$ denotes the set$\{a,b,ab,aa\}$$\{a,b,ba,bb\}$$\{a,b\}$$\{aa,ab,ba,bb\}$
User Avatar
1 votes
1 answer
103
NIELIT 2017 DEC Scientific Assistant A - Section B: 19
Let $P, Q, R$ be a regular expression over $\Sigma$. If $P$ does not contain null string, then $R=Q+RP$ has a unique solution ___________ . $Q^{*}P$ $QP^{*}$ $Q^{*}P^{*}$ $\left ( P^{*}O^{*} \right)^{*}$
Let $P, Q, R$ be a regular expression over $\Sigma$. If $P$ does not contain null string, then $R=Q+RP$ has a unique solution ___________ .$Q^{*}P$$QP^{*}$$Q^{*}P^{*}$$\l...
User Avatar
2 votes
2 answers
106
NIELIT 2016 MAR Scientist B - Section C: 24
Which of the following regular expressions denotes a language comprising all possible strings over the alphabet $\{a,b\}$? $a^*b^*$ $(a\mid b)^*$ $(ab)^+$ $(a\mid b^*)$
Which of the following regular expressions denotes a language comprising all possible strings over the alphabet $\{a,b\}$?$a^*b^*$$(a\mid b)^*$$(ab)^+$$(a\mid b^*)$
User Avatar
0 votes
2 answers
110
NIELIT 2017 DEC Scientist B - Section B: 35
Which of the following regular expression is equal to $(r_1+r_2)^*$? $r_1^*r_2^*$ $(r_1r_2)^*$ $r_1^*r_2^*+r_1r_2$ $(r_1^*r_2^*)^*$
Which of the following regular expression is equal to $(r_1+r_2)^*$?$r_1^*r_2^*$$(r_1r_2)^*$$r_1^*r_2^*+r_1r_2$$(r_1^*r_2^*)^*$
User Avatar
1 votes
2 answers
111
NIELIT 2017 DEC Scientist B - Section B: 41
Which of the following is equivalent regular expressions? $((01)^*(10)^*)^*$ $(10+01)^*$ $(01)^*+(11)^*$ $(0^*+(11)^*+0^*)^*)$ (i) and (ii) (ii) and (iii) (iii) and (iv) (iv) and (i)
Which of the following is equivalent regular expressions?$((01)^*(10)^*)^*$$(10+01)^*$$(01)^*+(11)^*$$(0^*+(11)^*+0^*)^*)$(i) and (ii)(ii) and (iii)(iii) and (iv)(iv) and...
User Avatar
Page: