DRAW THE NPDA Create an NPDA for the following language: On summation  = {0.1} Language 1 (L1) every string in the language begin and end with 1 Language 2 (L2) all strings in the language begin with 001 The union of L1 and L2

Theory of Computation Statement: Every regular language is a CFL(Context-Free Language) Prove this statement by using a DFA

Consider the language L defined by these rewrite rules S->A | AX X->ABY | AB Y->ABCY | ABC BA -> AB CA -> AC CB -> BC A->a B->b C->c   Question 1: (16) (a) Derive the string “a”.   (b) Derive the string “aab“     (c ) Derive the string “aaabbc”   (d) Derive the string “aaaabbbcc”   (e) Describe the strings that are in L.