For = {a, b} construct dfas that accept the sets consisting of all strings with no more than two as.

Recall: A deterministic finite accepter or DFA is defined by the 5-tuple

M = (Q, , S, q₀, F), where

Q is a finite set of internal states

is a finite set of symbols called the input alphabet

S : Q x Q is a total function called the transition function

q₀ Q is the initial state

F Q is a set of final states

Transcribed image text