3 3 votes How to solve this type of questions ? Every substring of four symbols has at most two 0's. For example, 001110 and 011001 are in the language, but 10010 is not since one of its substrings, 0010, contains three zeros. over the alphabet 0 and 1. Theory of Computation theory-of-computation finite-automata + – user123456987 2.1k views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
Best answer 3 3 votes Identify all strings with length 4 and have atmost 2 zeros then derive relation between such strings and draw DFA Deepthi_ts answered Apr 11, 2017 • selected Apr 19, 2017 by user123456987 Deepthi_ts comment Share Follow 0 reply Please log in or register to add a comment.
