Draw the state diagram of a DFA over {0,1} that accepts binary strings in which the number of 0s is a multiple of 3. Also show the regular expression.
Draw the state diagram of a DFA over {0,1} that accepts binary strings in which the number of 0s is a multiple of 3. Also show the regular expression.
From the Combined Bank Assistant Programmer (CSE) March 2021 – Preliminary exam, question 85 of 86.
More from this paper
- Previous: Write SQL commands for the following tables. Employee (ename, street, city) Works (ename, cname, salary, joindate) Company (cname, city)…
- Next: Write a focus writing in English on 'Bhasan Char – A Safe Home for Rohingya Refugees'.
- All questions in Combined Bank Assistant Programmer (CSE) March 2021 – Preliminary