Question: a ) Draw up a deterministic automaton ( DFA ) that accepts all words containing the sub - string 1 0 1 1
a Draw up a deterministic automaton DFA that accepts all words containing the substring AND provide a regular expression.
b Draw up a DFA that accepts all words NOT containing the substring
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
