Z). Prove Consider alphabet Σ = {0,1,2,3) and language L = = {w=Σ* : or disprove that L is context-free. w01"23" for some positive m,n € Z

None of the answers can be two choices; there can only be one answer.

x Bird(x)=Can- Fly(x) This universal quantifier used here implies that Oa. All reptiles cannot fly Ob All that flies is a Bird All Birds can fly Oc. All chicken are birds Od.

Answer only if you are 100% sure . Correct and detailed answer will be Upvoted else downvoted. Thank you!

Let EQRE = {<R, S> | R and S are equivalent regular expressions}. Show that EQRE epsilon to PSPACE.

Prove that the following is regular :

Let E= {a, b}. Given regular expressions r = a*b*, r' = ba(ab)* + ab*ba* and r" = (a + b)aa(a + b)*, find L(r), L(r'), and L(r"), the languages defined by r, r', r", respectively.

13. Show that the language L = {a" : n > 0, n # 4} is regular.

1. Fill out the table for executing the polynomial-time dynamic programming algo- rithm for deciding whether the string 1001 is in the context-free language generated by the following CFG. Fill the table completely do not stop the algorithm early. (Note: This CFG is not quite in Chomsky Normal Form since A appears on the right-hand side of a rule, but the same algorithm still works.) А — ВС | СС В — ВА| 0 С + АВ | ВВ | 1