Construct a DFA that does not recognises L, where L = {w|w
contains a substring of 101}.
Construct a DFA that does not recognises L, where L = {w|w contains a substring of 101}.
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
Construct a DFA that does not recognises L, where L = {w|w contains a substring of 101}.
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!