Question

Let be a, b, c} and let M be the language over 2 determined by the regular expression E a*bbc*. Construct an automaton (DFA) that recognises (accepts)

Answer 1

Given the z = {a,b, ef regular express porn Esa*b/bc* expire Spoo) can accept a*b or bo* We so the possible streings may be So, 26, aab, arab, tee, lege, becc -..] 2002 rructive me 2007 construct and bo* then combine them for cany DEA for atb form a single.. to DPA fon a*b - DFA for bot we need a little bit these two combining Now for change at bo* bo* get the final DFA Now combine for & the both to atb/bct

Editor Multiple Run Table Text Size Input Result aaabbb aabbb aaaaaab bCCCCCCCC bc bcb bcaaa abc bac cba Accept Accept Reject Reject Accept Accept Accept Reject Reject Reject Reject Reject Reject Reject Accept Accept b aaaaaaaaaab bcccccccccccc Load Inputs Run Inputs Clear Enter Lambda View Trace