• recategorized by
316 views

1 Answer

Best answer
1 1 vote

Answer is option (D)

Given regular expression is of language with strings starting with a and ending with b, or starting with b and ending with a.
Only string aabb is under this expression.

• selected by
Position:
Show:

Related questions

0 0 votes
1 answers 1 answer
323
323 views
admin asked Oct 10, 2024
323 views
Let the regular expression of all the strings generated from English lowercase letters, which starts with a vowel, and has odd number of letters can be expressed as $[a+e...
1 1 vote
1 answers 1 answer
412
412 views
admin asked Oct 10, 2024
412 views
Which of the following properties is always applicable to the numbers generated by the regular expression $1[3+6+9]^{*} 8$ ?OddDivisible by $3$Divisible by $8$Divisible b...
0 0 votes
1 1 answer
347
347 views
admin asked Oct 10, 2024
347 views
Let $L$ be a regular language and $F$ be a finite language over $\{0,1\}$. Consider the statements: (i) $L \cup F$ is regular, and (ii) $L \cup F^{c}$ is regular, where $...
0 0 votes
1 1 answer
334
334 views
admin asked Oct 10, 2024
334 views
 Let us consider the language $\left\{\epsilon, a, a^{2}, \ldots, a^{10}\right\}$, where $\epsilon$ denotes the empty string, and $a^{n}$ denotes $\underbrace{a a \cdots ...