MT 2 - Missed Questions

Question 1

Every subset of a regular language is a language

Answer 1

Y; A subset of a set is a set, and languages are sets

Question 2

Pumping Lemma proves that a language is not regular

Answer 2

N; Pumping Lemma serves as a tool for proving that a language is not regular

Question 3

Any finite language is CF

Answer 3

Y; Any finite language is regular and RL ⊂ CFL

Question 4

L ⊆ Σ* is CF iff L = L(G)

Answer 4

N; G must be a CFG

Question 5

A language is CF iff it is accepted by a CFG

Answer 5

CFL generated by a CFG, not accepted by it

Question 6

Pattern diagram =

Answer 6

Names of states removed