3. (8 points) Consider the deterministic finite automaton M with states {Q, R, S, T}, input...

 

Transcribed Image Text:

3. (8 points) Consider the deterministic finite automaton M with states {Q, R, S, T}, input alphabet {0, 1}, start state Q, accepting states Q and S, and with the following transitions: 0,1 T 0,1 1 0 R 1 0 S 3.1) (3 points) How many states are there in an equivalent minimal finite state automaton? 3.2) (3 points) How many accepting states are there in an equivalent minimal finite state automaton? 3. (8 points) Consider the deterministic finite automaton M with states {Q, R, S, T}, input alphabet {0, 1}, start state Q, accepting states Q and S, and with the following transitions: 0,1 T 0,1 1 0 R 1 0 S 3.1) (3 points) How many states are there in an equivalent minimal finite state automaton? 3.2) (3 points) How many accepting states are there in an equivalent minimal finite state automaton?

Answer rating: 100% (QA)

31 To find the number of states in an equivalent minimal finite state automaton FSA we need to minim... View the full answer