Question 2 Consider a Finite State Machine (FSM) (deterministic or nondeterministic) that accepts strings over {0, 1, 2} where the strings contain at least one substring that consists of three...

w2

Extracted text: Question 2 Consider a Finite State Machine (FSM) (deterministic or nondeterministic) that accepts strings over {0, 1, 2} where the strings contain at least one substring that consists of three identical alphabets or characters in a row. For example, some valid strings are, 012111210, 100222111, 2100012 etc. Some invalid strings are A, 010, 0121210, 0101011, etc. A finite state automaton (NFA or DFA) needs to be constructed to demonstrate the above scenario. a) Is it easier to solve this problem with an NFA or a DFA? Why? Give your rationale (reasons) in not more than two or three sentences. Consider the above scenario and construct a simplest possible Nondeterministic Finite Automaton (NFA) using state transition diagram to recognize the language specified. b) Construct a deterministic finite automaton (DFA) for the NFA you have constructed in question a) above.