Finite automata: DFA, NFA
Theory of Computation · Engineering
Study notes
DFA for strings ending in '01' over {0,1}: states q0 (start, no suffix), q1 (last was 0), q2 (accept, ends 01). Transitions: q0--0-->q1, q0--1-->q0; q1--0-->q1, q1--1-->q2; q2--0-->q1, q2--1-->q0. Input 101: q0-1->q0, -0->q1, -1->q2: accept. Input 110: ends q0: reject.