Consider the language described below and answer the questions
Language of braces
Language of the correctly nested braces e.g.
Valid string: [ [ [ ] [ ] ] [ ] ]
Invalid String [ ] ] [ [ ]
Prove by pumping lemma that the language is a non-regular language.
Create a context free grammar for the language
Create a push down automata for the language to accept the valid strings and to reject the invalid strings
Starting character of the tape is printed with s for indicating the start of the tape.
Drop in my office before deadline in hard form