1 votes 1 votes Which of the following regular expressions defines a language that is different from the other choices? $b^{\ast }\left ( a+b \right )^\ast a\left ( a+b \right )^ \ast ab^\ast \left ( a+b \right )^{\ast }$ $a^{\ast }\left ( a+b \right )^{\ast }ab^{\ast }\left ( a+b \right )^{\ast }a\left ( a+b \right )^{\ast }$ $\left ( a+b \right )^{\ast }ab^{\ast }\left ( a+b\right )^{\ast }a\left ( a+b \right )^{\ast }b^{\ast }$ $\left ( a+b \right )^{\ast }a\left ( a+b\right )^{\ast }b^{\ast }a\left ( a+b \right )^{\ast }a^{\ast }$ $\left ( a+b \right )^{\ast }b^{\ast }a \left ( a+b\right )^{\ast }b^{\ast }\left ( a+b \right )^{\ast }$ Theory of Computation tifr2021 theory-of-computation regular-expression + – soujanyareddy13 asked Mar 25, 2021 recategorized Nov 20, 2022 by Lakshman Bhaiya soujanyareddy13 566 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 1 votes 1 votes Language of options $(a),(b),(c)$ and $(d)$ is the set of strings over $\{a,b\}$ containing at least two $a’s$. Language of option $(e)$ is the set of strings over $\{a,b\}$ containing at least one $a$. jatinmittal199510 answered Mar 25, 2021 selected Mar 25, 2021 by gatecse jatinmittal199510 comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Option E is the answer Bcz only 1 a {a} as a minimum string is getting in option A,B,C,D Minimum 2 a string {aa} akshat sharma answered Mar 25, 2021 akshat sharma comment Share Follow See all 0 reply Please log in or register to add a comment.