Register

GATE Overflow Test Series | Theory of Computation | Test 1 | Question: 20

• edited by
78 views

1 Answer

Best answer
2 votes
2 votes
The given regular expression does not generate any string where "a" comes after any "bb". This rules out options A, C and D. Option B is indeed generated by the given regular expression.
• selected by
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

4 votes
4 votes
2 answers
1
gatecse asked Sep 29, 2020
367 views
GATE Overflow Test Series | Theory of Computation | Test 1 | Question: 5
For $L=\{\varepsilon \},$ if the number of total and final states required in the minimal state deterministic finite automata to accept $L$ over $\Sigma = \{a,b\}$ are denoted by $a$ and $b$ respectively, then $a-b = $_____
For $L=\{\varepsilon \},$ if the number of total and final states required in the minimal state deterministic finite automata to accept $L$ over $\Sigma = \{a,b\}$ are de...
User Avatar
2 votes
2 votes
1 answer
3
gatecse asked Sep 29, 2020
166 views
GATE Overflow Test Series | Theory of Computation | Test 1 | Question: 13
Given that $\Sigma = \{a\},$ which of the following finite automata correctly implements the regular expression $a^{\ast}?$ (Mark all the correct options)
Given that $\Sigma = \{a\},$ which of the following finite automata correctly implements the regular expression $a^{\ast}?$ (Mark all the correct options)
User Avatar
Link Copied!