Question

Convert the following Regular Expression (RE) to Deterministic Finite

Automaton (DFA) by Subset Construction Algorithm. Σ = {a,b,c,d}

Regular Expression: ((a+b)|c)* ((a+b+c+d)*c)|d|abc*|d*
​

Answer 1

Answer:

.......................