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

Casual Mode - Take your time!

1 / 21
✓
Correct
0
✗
Incorrect
0
★
Score
0%
Multiple Choice

Consider the following Finite State Automaton:

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

  1. b* ab* ab* ab*
  2. (a + b)*
  3. ba (a + b)
  4. b* ab* ab*
Change Mode