CISC $603$ M$02$ HW$1$

Deterministic Finite Accepters

Provide solutions to the following exercises. Solutions should be in the form of a hand$-$drawn transition graph $($you may instead use a software tool like the Finite State Machine Designer$).$ Note: Text descriptions and ASCII images will not be accepted.

Linz Section $2\mathrm{.}1$

For ${\displaystyle \underset{?}{\overset{?}{}}}=\{a$;$b\},$ construct DFAs that accept the sets consisting of

$($a$)$ all strings of odd length

$($b$)$ all strings of even length

$($c$)$ all strings of length greater than $5$

$($d$)$ all strings with an even number of a$\text{'}$s

$($e$)$ all strings with an even number of a$\text{'}$s and an odd number of b$\text{'}$s