Menu Close

Automata Assignment Three

Consider the language described below and answer the questions

Language of braces

Language of the correctly nested braces e.g.

Valid string: [ [ [ ] [ ] ] [ ] ]

Invalid String [ ] ] [ [ ]

Question 1:

Prove by pumping lemma that the language is a non-regular language.

Question 2:

Create a context free grammar for the language

Question 3:

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.

DeadLine: 07-12-2016

Submission Instruction:

Drop in my office before deadline in hard form

Leave a Reply

Your email address will not be published. Required fields are marked *