Preliminary program:
<ol>
<li> Introduction
<ul>
	<li> Foreword (week 1)
	<li> Mathematical basic concepts (week 1)
	<li> Computational problems and solvability, the hierarchy of 
	formal languages (week 1-2) 
</ul>
<li> Finite automata and regular languages
<ul>
	<li> Regular expressions and languages (week 2)
	<li> Deterministic finite automata (week 2-3)
	<li> Minimizing deterministic automata (week 3)
	<li> Nondeterministic finite automaton and its determinization 
	<b>week 3</b>
	<li> Transforming automaton to regular expression and regular 
	expression to automaton <b>week 4 </b> 
 	<li> Pumping Lemma <b>week 5</b>
</ul>
<li> Grammars and parsing 
<ul>
	<li> Context-free grammars and languages: the basic idea <b>week 5</b>
	<li> Context-free  grammars <-> automata (transforming linear grammar 
	into finite automaton and vice versa) 
	(week 5) 
        <li> *Excursion: L-systems (<b>week 5</b>)
	<li> Pushdown automata  (week 6)<br>

	<b>N.B.</b> You don't have to manage the method, how to construct a
	pushdown automaton from the given grammar and vice versa, just
	the result that they describe exactly the same language.

	<li> Recursive parsing (parsing, LL(1)-grammar, constructing a 
	recursive parser from a given LL(1)-grammar) (weeks 6-7 i.e. 
	25.2./3.3.)
	<li> *Attribute grammars 
	<li> CYK-algorithm (week 7 i.e. 4.3.)	
	<li> Chomsky normal form (weeks 7-8 i.e 5.3./10.3.)
	<li> Applications and restrictions of context-free langauges 
	(week 8 i.e. 10.3.)
	
</ul>
<br>
WEEK 8: Middle term exam (Fri 14.3.12.00-15.00 TD106) and 
ART EXHIBITION (Tue 11.3. at 12.15-14)!<br> 
 
<li> Turing machines and unristricted languages
<ul> 
<li> Turing machines: basic idea (<b>week 9 i.e. 17-18th Mar</b>)
<li> Extensions: multiple tape or track machines (<b>week 9</b>)
<li> Nondeterministic <-> deterministic machines (<b>week 9</b>)
<li> Unristricted and context-sensitive grammars (<b>week 10</b> i.e. 
24.-25.3.)
</ul>

<li>Solvability and unsolvability
<ul>
<li> Recursive and recursively enumerable languages, unsolvable problems 
(<b>week 10</b>)
<li> Self-respection, universal machines and languages (week 10)
<li> *Excursion: mecanic computability  <-> human reasoning
(week 11)
<li> Comparing and reducing problems (week 11)
</ul> 

<li> Computational complexity <b>Volunteer project work 1 cu</b>
<ul>
<li> Time and space requirements of the Turing machines
<li> NP-completeness
</ul> 
</ol>