Unformatted text preview: Final Study Guide CISC 303 Timo Kötzing ([email protected]) The nal will basically consist of questions similar to homework problems of the homework sets 5-11. In addition
to this, there will be some general questions regarding regular languages, and regarding similarities and dierences of
the dierent automata models. Hence, you should make sure to understand all homework problems. In particular,
the following would be helpful. • Know and understand all kinds of automata in graphical notation: DFA, NFA, ε-NFA, PDA, DPDA, TM;
dierence in notation in the dierent models; acceptance in the dierent models.
• Know properties of regular languages: closure properties, characterization by regular expressions, NFA, ε-NFA
• Know examples of languages that are: regular; context-free and not regular; decidable and not context-free;
semi-decidable and not decidable; not semi-decidable.
• Be able to give grammars accepting a given language; understand a given grammar.
• Be able to give parse-trees, left-most derivations, right-most derivations.
• Be ably to apply all algorithms that we talked about in class or in homework. In particular, be able to apply all
algorithms on context-free grammars, including conversion to CNF;
• Be able to non-deterministically parse a given input.
• Be able to show a function to be computable by using closure properties as given in Theorem 3.2.1 in the script
and a given set of library functions.
• Be able to use the Church-Turing Thesis to informally show a set to be decidable or semi-decidable.
• Be able to use TM-modier and reduction to show a language to be not decidable.
• Know how to show a language to be not semi-decidable. In particular, you will not be asked about • Algorithms on DFAs, NFAs, ε-NFAs or (D)PDAs;
• Complexity Theory. 1 ...
View Full Document
- Spring '08
- Formal language, closure properties