Back to the 2020 paper
Similar questions
FORMAL LANGUAGE & AUTOMATA THEORYConstruct DFA for all strings over \{0,1\} interpreted as binary numbers divisible by 4.20247mFormal Language & Automata TheoryConstruct a DFA that accepts all strings over \{0,1\} containing an even number of 0s and an odd number of 1s. Also, write its formal 5-tuple definition.20257mFormal 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 states20192mFormal Language & Automata TheoryA 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 states20212m