Log In
0 votes
which one of the following regular expression describe the language over {a,b} consist of no pair of consecutive a’s?

a.    (b*abb*) (a+€)

b.    (b+ab)* (a+€)

c.     (b*abb*)*(a+€)+b*

d.    (b*ab*)*(a+€)+b*(a+€)

in Theory of Computation 245 views

1 Answer

1 vote
(b) is Correct.

(a) fails for L= {abab, ababa,..}, given regular expression doesn't represents {abab, ababa,..}. Observe this option is not capable of representing more than 2 a's in an expression. therefore abababa... and for all such expressions it will fail

(c) fails for L= {ba}, given regular expression doesn't represents {ba} which canbe easily observed

(d) fails because it represents aa,aaa,aaaa.., which it should not.

edited by
Thank you

How A doesn't represent {a}

C doesn't represent {ba} explain

Related questions

4 votes
1 answer
The tail of a language is the set of all suffixes of its strings, that is tail(L) = {y : xy ∈ L for some x ∈ Σ ∗ }. How do I show that the family of regular languages is closed under this operation.
asked Oct 9, 2017 in Theory of Computation Garrett McClure 358 views
0 votes
1 answer
To Convert regular expression to DFA -> In most of the RE we can not directly convert it to DFA we have to first converting it to NFA-null then NFA-without null and then DFA and that takes too much time to me plz tell me any short cut to do this if any else conform me this is the only way.
asked Apr 1, 2017 in Theory of Computation Ronak520 209 views