CS-C2160 - Theory of Computation, 12.01.2021-14.04.2021
Kurssiasetusten perusteella kurssi on päättynyt 14.04.2021 Etsi kursseja: CS-C2160
Lecture 2. Finite automata
Suorituksen vaatimukset
State diagrams and transition tables. Programming with finite automata. Formal definition of a finite automaton. *Excursion: Extensions of finite automata.
2.1 State diagrams and transition tables
2.2 Programming with finite automata
2.3 Formal definition of finite automata