• edited by
3,990 views
1 1 vote
Choose the correct statement for the following regular expression over the symbols 0 & 1.
0(0+1)*0 + 1(0+1)*1
(a) To represent all strings over 0’s and 1’s
(b) To represent all strings which start with 0’s and end with 1’s
(c) To represent all strings which start and end with same symbol
(d) To represent all strings that starts and ends with 1’s

2 Answers

1 1 vote

option C is correct.

it represents all strings which start and end with same symbol

Position:
Show:

Related questions

7 7 votes
4 4 answers
4.7k
4.7k views
Pranav Madhani asked Nov 19, 2017
4,651 views
Determine the minimum height of parse tree in CNF for terminal string of length w, which is constructed by using CFG G(a) log2|w|+1 (b) log2|w|(c) log2|w|−1 (d) None of t...
1 1 vote
2 answers 2 answers
3.3k
3.3k views
Pranav Madhani asked Nov 18, 2017
3,333 views
Consider the language defined by the regular expression (a | b) * b+.Which of the following regular expressions also define that language?(i) (a*b+) | (b*b+)(ii) (ab |bb)...
0 0 votes
1 1 answer
1.7k
1.7k views
Pranav Madhani asked Nov 17, 2017
1,682 views
Consider 2 regular expression:i. ϕ* + a+ + b+ + (a + b)+ → r1ii. ϕ+ + a* + b* + (a + b)* → r2(a) L(r1) = L(r2) (b) L(r1) ⊆ L(r2)(c) L(r1) ⊇ L(r2) (d) None of aboveSolutio...
0 0 votes
1 answers 1 answer
1.2k
1.2k views
Pranav Madhani asked Nov 17, 2017
1,235 views
Consider this grammar:S → SS | aHow many derivation trees are possible for a4?(a) 3 (b) 4(c) 5 (d) 6 how to generalize for any values if a^5 or a^7 is there any general f...