Register

UGC NET CSE | June 2007 | Part 2 | Question: 4

• edited by
1,275 views
1 votes
1 votes

The regular expression given below describes:

$r=(1+01)$*$(0+\lambda)$

  1. Set of all string not containing $’11’$
  2. Set of all string not containing $’00’$
  3. Set of all string containing $’01’$
  4. Set of all string ending in $’0’$
• edited by
User Avatar

1 Answer

1 votes
1 votes
Let us eliminate options by counter examples:

option a:

given expression can generate 111. So this is wrong.

Option c:

Given expression can't generate the string 0100 which contains 01.So this is wrong.

Option d:

Given expression can't generate the string 00 which ends with 0. So this is wrong.

Hence option b is the answer.
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
go_editor asked Mar 28, 2020
478 views
UGC NET CSE | June 2007 | Part 2 | Question: 1
The following determiniotic finite automata recognizes: Set of all strings containing $’ab’$ Set of all strings containing $’aab’$ Set of all strings ending in $’abab’$ None of the above
The following determiniotic finite automata recognizes:Set of all strings containing $’ab’$Set of all strings containing $’aab’$Set of all strings ending in $’a...
User Avatar
0 votes
0 votes
0 answers
2
go_editor asked Mar 28, 2020
709 views
UGC NET CSE | June 2007 | Part 2 | Question: 2
Depth ion travels of the following directed graph is: $\text{A B C D E F}$ $\text{A B D E F C}$ $\text{A C E B D F}$ None of the above
Depth ion travels of the following directed graph is:$\text{A B C D E F}$$\text{A B D E F C}$$\text{A C E B D F}$None of the above
User Avatar
0 votes
0 votes
0 answers
3
go_editor asked Mar 28, 2020
1,162 views
UGC NET CSE | June 2007 | Part 2 | Question: 3
The maximum number of nodes in a binary tree of depth $10$: $1024$ $2^{10}-1$ $1000$ None of the above
The maximum number of nodes in a binary tree of depth $10$:$1024$ $2^{10}-1$ $1000$None of the above
User Avatar
0 votes
0 votes
1 answer
4
go_editor asked Mar 28, 2020
294 views
UGC NET CSE | June 2007 | Part 2 | Question: 5
Which of the following language is regular: $L=${${a^{n}b^{n}|n\geq 1}$} $L=${${a^{n}b^{m}c^{n}d^{m}|n,m\geq 1}$} $L=${${a^{n}b^{m}|n,m\geq 1}$} $L=${${a^{n}b^{m}c^{n}|n,m\geq 1}$}
Which of the following language is regular:$L=${${a^{n}b^{n}|n\geq 1}$}$L=${${a^{n}b^{m}c^{n}d^{m}|n,m\geq 1}$}$L=${${a^{n}b^{m}|n,m\geq 1}$}$L=${${a^{n}b^{m}c^{n}|n,m\ge...
User Avatar
Link Copied!