Finite automata for at least one a and at least one b Finite automata for at least one a and at least one b Related Posts:Regular expression for at least one a and at least one bFinite automata for all strings with at least one aFinite automata for all strings with at least two aFinite Automata | Finite State Machines | Deterministic FSM Finite automata FA for the language of all those strings starting with a and ending with a in theory of automataFinite automata FA for the language of all those strings starting and ending with same letters in theory of automata