Scribd
Upload
515 views2 pages

Ex 2

kjd

Uploaded by

Prashanth Prabhakar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
515 views2 pages

Ex 2

kjd

Uploaded by

Prashanth Prabhakar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 2
N w a x 90 10 EXERCISES Use the construction of Theorem 2.2 to convert the nfa in Figure 2.10 toa dfa. Can you sce a simpler answer more directly? Convert the nfa in Exerc’ 13, Section 2.2, into an equivalent dfa. Convert the nfa defined by (do) = {405%} (415%) = {a0} (aa) = {a} with initial state gq and final state g) into an equivalent dfa. Convert the nfa defined by (q,4) = {40,0} (4158) = {900%} 5(a2,4) = {a} (09) = {aa} with initial state qq and final state g) into an equivalent dfa. Convert the nfa defined by 5(d0s0) = {aoa} (a,b) = {a0} 5(a2,2) = {a} ar) = {aa} with initial state gy and final state 7) into an equivalent dfa. Carefully complete the arguments in the proof of Theorem 2.2. Show in detail that if the label of 5} (go, v) contains yy, then by (go, w) also contains 4p Is it true that for any nfa M = (Q, 2, 3, qo, F), the complement of L (M) is equal to the set {w € F:8* (q, wv) N F=2}? Ifso, prove it. If not, give a counterexample. Is it true that for every nfa M = (Q, , 8, qo, F), the complement of L (M) is equal to the set {w € 2:3" q, wv) N (Q-F) #2}? If so, prove it; if not, give a counterexample. Prove that for every nfa with an arbitrary number of final states there is an equivalent nfa with only one final state. Can we make a similar claim for dfa’s? Find an nfa without A-transitions and with a single final state that accepts the set {a}U {b" : n> 2}. Let L be a regular language that does not contain A. Show that an nfa exists without A- transitions and with a single final state that accepts L. Define a dfa with multiple initial states in an analogous way to the corresponding nfa in Exercise 18, Section 2.2. Does an equivalent dfa with a single initial state always exist? . Prove that all finite languages are regular. Show that if Lis regular, so is LX. . Give a simple verbal description of the language accepted by the dfa in Figure 2.16. Use this to find another dfa, equivalent to the given one, but with fewer states. Let L be any language. Define even (w) as the string obtained by extracting from w the letters in even-numbered positions; that is, if w= aja7a3a4..., then Corresponding to this, we can define a language even (L) = {even (w) :w & L}. Prove that if L is regular, so is even (L). . From a language L., we create a new language, chopleft (L), by removing the leftmost symbol of every string in L. Specifically, chopleft (L) = fw : vw & L, with |v = 1}. Show that if L is regular, then chopleft (L) is also regular. . From a language L, we create a new language chopright (L), by removing the rightmost symbol of every string in L. Specifically, chopright (L) = {ws w & L, with | Show that if J is regular, then chopright (L) is also regular.

You might also like