Deterministic finite automata (DFA) (have odd length or end with aaa) - Mathematics Stack Exchange
Construct the DFA which accepts all the strings of a's & b's where each string contain odd occurrence of the substring 'ab' . Fid the number of states in minimal DFA? What
Need Regular Expression for Finite Automata: Even number of 1s and Even number of 0s - Stack Overflow
DFA String Examples
Automata Theory - Quick Guide
Finite automata FA for ending with b in theory of automata | T4Tutorials.com
What are the steps to construct automata which can accept an even string? - Quora
Odd Number of a's and Odd Number of b's Regular Expression| Theory of Automata Tutorial Lecture 45 - YouTube
Regular expression for the language of all odd length strings in theory of automata | T4Tutorials.com
Regular Expression for an odd number of 0's or an odd number of 1's in the strings | T4Tutorials.com