Test 2 - Theory of Computation | Computer Science(CS)

Time: 00:00:00

0

Attempted

21

Not Attempted

0

Marked For Review

0

Attempted & Reviewed

Question 1 of 21

Consider the following Finite State Automaton:

The language accepted by this automaton is given by the regular expression

Select Your Answer:

b* ab* ab* ab*

(a + b)*

ba (a + b)

b* ab* ab*

Mark for Review

All Questions

Attempted

Not Attempted

Marked for Review

Attempted & Reviewed

Current