RGPV 2007
Q. Define deterministic finite automta. Draw DFA that accepts any string which ends with 1 or it ends with an even number of 0’s following the last 1. Alphabets are {0,1}.
Ans. Some example strings = {1, 001, 01001, 011}
