Register

Search results for regular

64 votes
8 answers
1
GATE CSE 1997 | Question: 6.4
Which one of the following regular expressions over $\{0,1\}$ denotes the set of all strings not containing $\text{100}$ as substring? $0^*(1+0)^*$ $0^*1010^*$ $0^*1^*01^*$ $0^*(10+1)^*$
Which one of the following regular expressions over $\{0,1\}$ denotes the set of all strings not containing $\text{100}$ as substring?$0^*(1+0)^*$$0^*1010^*$$0^*1^*01^*$$...
User Avatar
56 votes
12 answers
4
GATE CSE 2003 | Question: 14
The regular expression $0^*(10^*)^*$ denotes the same set as $(1^*0)^*1^*$ $0+(0+10)^*$ $(0+1)^*10(0+1)^*$ None of the above
The regular expression $0^*(10^*)^*$ denotes the same set as$(1^*0)^*1^*$$0+(0+10)^*$$(0+1)^*10(0+1)^*$None of the above
User Avatar
18 votes
7 answers
6
GATE CSE 2020 | Question: 51
Consider the following language. $L = \{{ x\in \{a,b\}^*\mid}$number of $a$’s in $x$ divisible by $2$ but not divisible by $3\}$ The minimum number of states in DFA that accepts $L$ is _________
Consider the following language.$L = \{{ x\in \{a,b\}^*\mid}$number of $a$’s in $x$ divisible by $2$ but not divisible by $3\}$The minimum number of states in DFA that ...
User Avatar
24 votes
3 answers
8
GATE CSE 2020 | Question: 7
Which one of the following regular expressions represents the set of all binary strings with an odd number of $1’$s? $((0+1)^*1(0+1)^*1)^*10^*$ $(0^*10^*10^*)^*0^*1$ $10^*(0^*10^*10^*)^*$ $(0^*10^*10^*)^*10^*$
Which one of the following regular expressions represents the set of all binary strings with an odd number of $1’$s?$((0+1)^*1(0+1)^*1)^*10^*$$(0^*10^*10^*)^*0^*1$$10^*...
User Avatar
42 votes
8 answers
12
GATE CSE 1992 | Question: 02,xvii
Which of the following regular expression identities is/are TRUE? $r^{(^\ast)} =r^\ast$ $(r^\ast s^\ast)=(r+s)^\ast$ $(r+s)^\ast = r^\ast + s^\ast$ $r^\ast s^\ast = r^\ast+s^\ast$
Which of the following regular expression identities is/are TRUE?$r^{(^\ast)} =r^\ast$$(r^\ast s^\ast)=(r+s)^\ast$$(r+s)^\ast = r^\ast + s^\ast$$r^\ast s^\ast = r^\ast+s^...
User Avatar
28 votes
5 answers
18
GATE CSE 2000 | Question: 1.4
Let $S$ and $T$ be languages over $\Sigma=\{a,b\}$ represented by the regular expressions $(a+b^*)^*$ and $(a+b)^*$, respectively. Which of the following is true? $S \subset T$ $T \subset S$ $S = T$ $S \cap T = \phi$
Let $S$ and $T$ be languages over $\Sigma=\{a,b\}$ represented by the regular expressions $(a+b^*)^*$ and $(a+b)^*$, respectively. Which of the following is true?$S \subs...
User Avatar
Page: