Register

Which one of the following doesn’t generate same language as rest?

3,311 views

5 Answers

2 2 votes

Look at R.E. 1 & 2,3,4 In R.E. 2 ,it cannot produce 'a'.

So Regular expression 1 will never generate same language as of others

2 2 votes
this the very simple . start with the minimum strings that can be made . starting with first string every language with a as a substring will be accepted. and minimum string will be a .but every other language minimum string will be aa. hence 1 is not like other.
0 0 votes
R.E. 1(min string is "a") is different from others R.E.2,3,4(min string is "aa" ) but R.E.1 can also generate "aa", so Ans is 5.All are generating same language, and the Language is having atleast 2 a’s.
Voting & Accepting an answer helps improve the community
← Previous · How is the below lan...Next → · why are IS and S loc...
← Previous in category · How is the below lan...Next in category → · TOC
Position:
Show:

Related questions

0 0 votes
1 1 answer
1.2k
1.2k views
M_Umair_Khan42900 asked Dec 29, 2022
1,248 views
Show that the following pairs of regular expressions define the same language over the alphabet I = [a, b]. s(a) p(pp)*( A + p)q + q and p*q (b) A +0(0+1)* + (0+1)* 00(0+1)* and ((1*0)*01*)* (c) (s*ttt)*s* and s*(ttts*)*
Show that the following pairs of regular expressions define the same language over the alphabet I = [a, b].s(a) p(pp)*( A + p)q + q and p*q(b) A +0(0+1)* + (0+1)* 00(0+1)...
1 1 vote
1 1 answer
3.2k
3.2k views
M_Umair_Khan42900 asked Dec 29, 2022
3,235 views
Write regular expression to denote a language L a) String which begin or end with either 00 or 11. b) The set of all strings, when viewed as binary representation of integers, that are divisible by 2. c) The set of all strings containing 00. d) String not containing the substring 110.
Write regular expression to denote a language La) String which begin or end with either 00 or 11.b) The set of all strings, when viewed as binary representation of intege...
1 1 vote
2 2 answers
2.5k
2.5k views
Mahesha999 asked Dec 25, 2016
2,541 views
Which one of the following languages is regular
1 1 vote
1 answers 1 answer
3.4k
3.4k views
Hari asked May 6, 2017
3,426 views
Regular expression describe the same set of string as Grammar
Consider the following GrammarS - Ax/ByA->By/CwB->x/Bwwhich of the regular expression describe the same set of strings as the grammar? The option are:(a) xw* y + xw* yx +...