Consider the following finite state automaton: ![diagram](https://res.

Back to the 2019 paper

Module 1: Introduction, Regular languages and finite automata

20192m

Consider the following finite state automaton:

diagram

The language accepted by this automaton is given by the regular expression
(i) $b^*ab^*ab^*ab$
(ii) $(a+b)^*$
(iii) $b^*a(a+b)^*$
(iv) $b^*ab^*ab$

Search Google Ask AI

Similar questions

Formal Language & Automata TheoryConstruct finite automaton corresponding to the regular expression: (a+b)^* c d^* e20207m Formal Language & Automata TheoryDesign a push-down automata for accepting the string for the language L = \{WW^R \mid W \in \{a, b\}^*\} by the empty stack as well as final state.20197m Compiler DesignConvert the regular expression (a+b)^*ab into NFA.20257m Formal Language & Automata TheoryConsider the regular expression (0+1)(0+1)\dots N \text{ times}. The minimum state FA that recognizes the language represented by this regular expression contains (i) n states (ii) (n+1) states (iii) (n+2) states (iv) None of the above20192m

NextA minimum state deterministic finite automaton accepting the language L = \{w \mid w \in \{0, 1\}^*, \text{ number of 0's and 1's in } w \text{ are divisible by 3 and 5 respectively}\} has (i) 15 states (ii) 11 states (iii) 10 states (iv) 9 states