Math 3614: Study Guide 9 (12/2-12/9)

Sections 9.4, 10.1, 10.2

Objectives:

1. Learn the following terms:
   • Karnaugh Map
   • Quine McCluskey Method
   • phrase-structure grammar
   • terminal, nonterminal
   • production
   • language generated by a grammar
   • type 3 (regular) grammar
   • type 2 (context-free) grammar
   • type 1 (context-sensitive) grammar
   • type 0 (phrase-structure) grammar
   • Backus-Naur form
   • finite-state machine
   • Kleene closure
   • deterministic/nondeterministic finite-state automata
   • regular expression
2. Become comfortable working the following types of problems:
   1. Use a Karnaugh map to simplify a boolean expression given in sum-of-products form.
   2. Use the Quine McCluskey Method to simplify a boolean expression.
   3. Given a grammar, describe the language generated by that grammar.
   4. Construct a grammar that generates a simple language.
   5. Construct a derivation of a string using a given grammar.
   6. Determine whether a string is in the language generated by a given grammar.
   7. Given a description of a grammar, determine whether the grammar is type 0, type 1, type 2, or type 3.
   8. Rewrite a given type 2 grammar in Backus-Naur form.
   9. Given the state table describing a finite-state machine, draw the state diagram.
   10. Given a state diagram describing a finite-state machine, give the state table.
   11. Construct a finite-state machine from an English description.
   12. Given a description of a finite-state machine, determine the output generated for a given input string.
3. Problem List:Learn to work the following problems:
   1. Section 9.4: 7, 17
   2. Section 10.1: 1, 5, 12, 13, 14
   3. Section 10.2: 1, 3, 5, 9, 13

   Answers to even numbered problems

   Click here for answers to the even numbered problems.

Evaluation: