Question

T F 5, Σ = {a,b), L = { s: s = anbm, nzn, m20, Isl s IP(Σ)13. (Th not longer than the number of elements in the power set of 2.) The re language pumping theorem could show that L RLs. T F 6. An NDFSM that recognizes a language L may have computation branc at is, s e L iff s is it accepts a string w L. 7. ISI = Ko, where S is a set. Ir(s)l S) 3a. (Note that lr(S)I is the power set o F 8. Σ= {a,b), L = ( s : anbm, n> m). A regular language pumping theorem proof showina that L T RLs could start with "Let w = a5b3"

Answer 1

5.TRUE

The above statement is True. Because it follows that is S that belongs to L . if and only if is not longer than the number of elements in the power set of sigma. Here the Regular Language of the Pumping Lemma Theorem could show that the L doesn't Belong to RL of the Regular Language.

6.FALSE

The NDFSM that doesn't recognizes the language L may have computation branches where it doesn't accept the string W and that is not Belongs to L.

7.TRUE

| S | = N here is S is a Set and the P | S | means the power set of S.

8.FALSE

A Regular Language Pumping Theorem Proof Doesn't Show that where L doesn't belongs to RL and that could not start with the "Let w = a^ 5 and b^3 "