A minimum state deterministic FA accepting the language L = \{w \mid w — PYQDeck

PyQdeckBEU PYQ Archive Subjects

Back to the 2021 paper

Module 1: Introduction, Regular languages and finite automata

20212m

A minimum state deterministic FA accepting the language

$L = \{w \mid w \in \{0, 1\}^*\}$

where number of 0's and 1's in $w$ are divisible by 3 and 5 respectively, has

(i) 15 states
(ii) 11 states
(iii) 10 states
(iv) 9 states

This question has repeated before

Also appeared in 2019.

Search Google Ask AI

Similar questions

FORMAL LANGUAGE & AUTOMATA THEORYA minimum state deterministic FA accepting the language: L = \{ w \mid w \in \{0,1\}^* \} where the number of 0's and 1's in w are divisible by 3 and 5 respectively, has: (i) 15 states (ii) 11 states (iii) 10 states (iv) 9 states20232m Formal Language & Automata TheoryA 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 states20192m FORMAL LANGUAGE & AUTOMATA THEORYA minimum state DFA for the language: L = \{ w \in \{0,1\}^* : \#0(w) \equiv 0 \mod 3,\; \#1(w) \equiv 0 \mod 5 \} has: (i) 15 states (ii) 11 states (iii) 10 states (iv) 9 states20212m 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

Previous\_\_\_\_ is the acyclic graphical representation of a grammar. (i) Binary tree (ii) Octtree (iii) Parse tree (iv) None of the above NextThe construction time for DFA from an equivalent NFA (m number of node) is (i) O(m^2) (ii) O(2^m) (iii) O(m) (iv) O(\log m)