Question

Can any one please help me. And also explain me step by step .

(6 pts) Suppose that usernames w 0 and 2 digits, and must end with the special character #. usernames, but 34# and SMITH4# a routine for verifying that must start with between 1 and 3 letters, followed by between Thus CA34 and RRS# are valid newly proposed usernames meet the requirements. Formally define ccepts the set of strings that are acceptable usernames. You must ne each member of the 5 tupple (for the transition function list a are not. You are the system administrator and must construct transition table) and draw the FSM.

Answer 1

Detormini fsM be detined as Set of states leefer Noo, it may hoen, thof ofter t ete, di come , then cla1

Moo, olgo, digu ,may corne tot "4 ? (letlen os aseth 2 ラ(4 2 dzit dit 4p oltot lst leden # aan come opplyi ot this A DfA ux geh cull Lve

大 10 digt nc Nai) fo㈨ au invada string, fata dead state otter digitlu cont come

digit grf letten, diyit Letter, d'git finol DA