FSM/FSA (Finite State Machine/Finite StateAutomata)
a) Design (draw) a FSA which accepts the language of strings of0s and 1s which have both 000 and 111 as substrings.
b) Design (draw) a FSA which accepts the language of strings of0s and 1s which have both 010 and 101 as substrings.
Expert Answer
An answer will be send to you shortly. . . . .