I have to draw a DFA that accepts set of all strings containing 1101 as a substring in it. I tried one by myself but wanted to make sure if it's correct but can't attach the image as I'm a new user.
Thanks
Its an easy DFA. It requires 5 states.
So it will look like
Copyright © 2021 Jogjafile Inc.
Its an easy DFA. It requires 5 states.
So it will look like