Evaluation of the 1st middle term exam 18.3. 2004
Maximum points 44.

Task 1: (M.M.) (total 12p)
- each part 4 points

(a) small errors in minimization (e.g. one-two incorrect transitions): -1
major errors (many incorrect transitions, invalid procedure): -2, -3

(b) if (a) is not correct, (b) also can't be. So in case of small errors
in (a) (b) is at most +3.
If (a) is correct, but the minimized is "almost" correct (5 states),
it is also at most +3.

(c) depends on (a) and (b). Similar criteria...

- for more details see comments on your solution paper

Task 2: (W.H.) (total 10p)
a) 4 points
- proof by PL 3 p
- if some correct idea of PL, 1-2 p
- grammar 1p
b) 3 p, if fully correct (either regular expression or finite automaton given)
- only correct answer 1p
- minor error in the automaton/expression 2p
c) * was missing in the task, so everybody got 3p. If some of you had still 
realized that the language is finite, then in addition extra point +1. 

Task 3: (W.H.) (total 10p)
5 subclasses, each of them:
- idea of the subclass 3/4p
- example grammar 1/2p
- how to parse best 3/4p

- In the largest class you could either describe all context-free
  languages or mention that it contains all other subclasses and
  inherently ambiguous languages.

Task 4: (M.M.) (total 12p)
- each part 3 points
- points were given for correct method/idea, even if the result was uncorrect
- for more details see comments on your solution paper