QUESTION $1$

$[$Total marks: $10]$

$1(a)$

$[4$ Marks$]$

Given the alphabet $\{0,1\},$ write a regular expression that represents all the binary

strings that contain an even number of $\text{'}1\text{'}$ digits.

$1(b)$

$[6$ Marks$]$

Use the subset construction method to derive a deterministic finite state automaton

that recognises the language from part $($a$).$

$[$End Question $1]$