QUESTION $1$

$[$Total marks: $10]$

Regular Expressions & DFAs

$1(a)$

$[4$ Marks$]$

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

strings that start with a $\text{'}0\text{'}$ digit and end with two consecutive $\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$).$