Exam Review

                        Test #1  Review Sheet

1.  Chapter 1 (about 10 percent) section 1.2:
          0.  what is a language
          1.  what is a grammar: common grammars

2.   Chapter 2 (about 50 percent)
    a.  DFA, transition diagrams, transition tables
        alphabet, states, empty string, 
        1.  what language does this FA accept?
        2.  draw a transition diagram or table for some language
        3.  what does it mean to say that an FA accepts a string 
        4.  terminology: such as states, start state, transitions,
            trap state, etc.
    b.  Regular Language: what does it mean to say a language is
        regular.
    c.  Non-deterministic FA, lambda transitions 
        1.  algorithm for changing a NFA to a DFA 
        2.  power of an NFA (are there languages accepted by a NFA but
            not a DFA?  No!!!).
    d.  Minimizing a DFA.

3.   Chapter 3 (about 30 percent)
    a.  Regular expressions: Kleene star, form of regular expressions
        1.  Write a regular expression for a particular description
        2.  Given a regular expression, describe the language it
                   represents
        3.  RE to NFA
        4.  NFA to RE
    b.  Regular grammars, form, derivation of a string
        1.  show the derivation of a string
        2.  algorithm RG to NFA algorithm
        3.  algorithm NFA to RG algorithm

4.   Chapter 4 (about 10 percent: through 4.1 only)   
    a.  Combination machine
    b.  Closure properties of regular languages
          = closed under Kleene Star, concatenation, union, 
            intersection, set difference, symmetric difference
    
5.  General questions, such as TRUE/FALSE. 
           Common Misconceptions (both are false.  Why?) 
        (1) A finite automata can only recognize languages with
            a finite number of strings.
        (2) If a grammar is not regular, then the language derived
            from the grammar is not regular. 

6.  Concepts from Programming Assignments