Define an automata M with sigma notequalto empty such that L

Define an automata M with sigma notequalto empty such that L (M) = empty Define an automata M with sigma = empty such that L (M) notequalto empty Define an automata M with sigma = empty such that L (M) notequalto empty Define an automata M with sigma notequalto empty such that L (M) = sigma* Prove that there always exist an automata M such that L (M) = sigma*

Solution

1) We can define this automate by making the set of final states to Empty set.

2) We can create this automata by having only one state and that state is both starting state and final state. So in this case the automata accepts null string. There is no transition table.

3) The question is same as above.

4) We can create this automata by having only one state and that state is both starting state and final state. For any symbol read the state loops to itself.