Question: 2. Let M be the deterministic finite automaton ?={a, b} 0 91 9 42 92 1 a) Give the state diagram of M. b) Trace

2. Let M be the deterministic finite automaton ?={a, b} 0 91 9 42 92 1 a) Give the state diagram of M. b) Trace the computation of M that processes babaab c) Give a regular expression for L(M d) Give a regular expression for the language accepted if both go and g? are accepting states
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
