Question: Question # 04: Construct a DFA that accept all the strings that end at 00 but third digit from left side must be 1 over
Question \# 04: Construct a DFA that accept all the strings that end at "00" but third digit from left side must be "1" over the alphabets ={0,1}. [1 Mark] Example string: 100 (accept), 1000(reject), 010 (reject), 111100 (accept), 1110011 (reject) etc
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
