Deterministic Finite Automaton DFA in Csharp

name@string1.string2,

where:

•namecan contain small letters (a−z), digits (0−9) and underscore (_); itmust start with a letter,

•string1can contain digits (0−9) and letters (a−z,A−Z) , must be non-empty,

•string2=”eu” orstring2=”pl”

.Assume that the verifier reads a single character at a time and that any typablecharacter can be encountered.