Question: 1. Given a DFSA M, you may be able to find another DFSA M' such that L(M) = L(M'). that is, find some (a)

1. Given a DFSA M, you may be able to find another DFSA M' such that L(M) = L(M'). that is, find some (a) Find two different DFSAs that recognize the same language M and M' such that L(M) = L(M'). (b) Find some DFSA M such that there is no equivalent DFSA M' that has only one accepting state. That is, find an M such that, for any DFSA M' with one accepting state, L(M) L(M'). Justify your answer: why can't your M be rewritten into one with one accepting state?
Step by Step Solution
There are 3 Steps involved in it
To solve these problems we need to understand Deterministic Finite State Automata DFSA and the langu... View full answer
Get step-by-step solutions from verified subject matter experts
