CMPE 222 [Bilgi university] [Theory of Computing]

What Will You Learn?

• Upon successful completion of the course, students will be able to;
• For a given regular language design a finite-state automaton (FSA) that recognizes this language.
• For a given context-free language, be able to design a push-down automaton (PDA) that recognizes the language. Also be able to write a grammar for the language.
• Prove that a given language is nonregular, using pumping lemma.
• Be able to verbally explain the language recognizes by the given automaton (FSA or PDA)
• Design a grammar for the given regular language and express the language as a regular expression.
• Be able to prove that a given grammar is ambiguous. Find leftmost derivation of a string or parse tree for a string.