create a regular expression that exactly parses the string d

create a regular expression that exactly parses the string described by the state machine above

Solution

A((BC*CDQ*A)+(ZY(XW+T)Q*A))

So Iinitially A is cumpulsory and having 2 paths.

1 path is B, C*(any number of c\'s)next C, Dand any number of Q\'s and A

2 path is ZY and agoin 2 paths XW and T add Q*and A