Fill in the following table with YES and NO. If the answer is NO, give an exampl

Question

Fill in the following table with YES and NO. If the answer is NO, give an example of language(s) that are used to show that it is a NO.

Closure Properties

Regular Lang.

CFLs

TM decidable

TM recognizable

union L1U L2 = L3

concatenation L1L2 = L3

star L*

intersection L1 L2 = L3

complementation L1

deterministic nondeterministic

Closure Properties

Regular Lang.

CFLs

TM decidable

TM recognizable

union L1U L2 = L3

concatenation L1L2 = L3

star L*

intersection L1 L2 = L3

complementation L1

deterministic nondeterministic

Explanation / Answer

yes yes yes yes yes yes yes yes yes yes no L=L(M) and M halts on all inputs yes yes no L1={0i1n2n|i,n>=0} and L2={0n1n2i|i,n>=0} and L2intersectsL3=l1={0n1n2n|n>=0} is not cfl} yes yes yes yes yes no no no no no

Related Questions

Navigate

• Browse (All)
• Browse F
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.