Question

Data Structures/Automata/Complexity:
I know what the regular expression and minimal DFA is of this problem; however, I'm stuck on Part C when determining if the given language is a regular language via pumping lemmas.

1. RL and FSA-Total (40 points) Let ?= {0,1} 0,1 Figure 1: a. (10 pts) What is the regular expression generating the language recognized by the NFA in Figure 1? b. (20 pts) Convert the NFA in Figure 1 to a minimal DFA c. (10 pts) Consider the language L {1101" 0"1" ln, m > 0). Ís this a regular lan- guage? Hint: Use the pumping lemma an appropriate string 1100P1P.

Answer 1

s aguk launge Then, herids a contant n (ahose valve deperrl upen L such hot er Evciy sh ring telernging to the langage L anel nn,w com be broken into e The fi al so therigy'z albo belongs to

Lits take a string NEL 00I1 into Xy2 hee ivide xy)en dele yi코 Hence ty pmplng lemme Given i not requler