edited by
3,248 views
1 votes
1 votes
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
edited by

2 Answers

1 votes
1 votes

option C is correct.

it represents all strings which start and end with same symbol

Related questions

7 votes
7 votes
4 answers
1
Pranav Madhani asked Nov 19, 2017
3,364 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...
0 votes
0 votes
1 answer
3
0 votes
0 votes
1 answer
4
Pranav Madhani asked Nov 17, 2017
833 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...