================================================================================================ Exam at 311 Practice Signature March 09 09 10 10 11 12 13 13 14 16 from 15:10 on Zachetka ------------------------------------------------------------------------------------------------ Priyatseliuk Nikita o o o o o o - o o O.K. O.K. done Kozhyn Maksim - - o o o o o o o O.K. O.K. done Ivanchuk Nikita - - o o o o o o o O.K. O.K. done Chaichyts Anastasiya - - o o - o o o o O.K. O.K. done Kuts Nikolay - - o o o - - - - O.K. O.K. done Litviniuk Igor - - o o o - - - - O.K. O.K. done ================================================================================================ 03/09 (i) What is Finite State Automaton? (ii) An example of obstacle avoiding in a grid-world 03/10 (i) Bending Machine as FSA (ii) Basics of Formal Language like strings starting with "a" 03/11 Pushdown Automaton 03/12 Linear Bounded Automaton 03/12 string a^{2^n} and a^{2!} 03/13 Free Grammer and Turing Machine 03/14 Summary: 4 categories of languages/state-mavhines relatons of the four 03/16 Examination 03/17 additional exam. if necessary ================================================================================================ ================================================================================================ March <- odditional -> O.K. if sum 09 09 11 11 12 12 13 14 14 14 not smaller than 24 ------------------------------------------------------------------------------------------------ Priyatseliuk Nikita 5 5 5 5 5 5 30 => O.K. Kozhyn Maksim 4.4 4 4 5 5 5 27.4 => O.K. Ivanchuk Nikita 3.5 4.5 4 5 5.1 5 27.1 => O.K. Chaichyts Anastasiya 3.5 4 4 5 5 5 26.5 => O.K. Kuts Nikolay 3 2 2.5 0 0 2.5 + 2.6 => escaped Litviniuk Igor 3 2 2.5 0 0 2.5 + 2.6 => escaped ------------------------------------------------------------------------------------------------ 16 17 17 17 Kuts + 2.5 => told no time to continue + 2.5 + 3.0 + 2.5 23.1 => O.K. Litviniuki + 2.5 => told no time to continue + 2.5 + 3.0 + 2.5 23.1 => O.K. ================================================================================================ 03/09 Behavior of FSA with 8 states, 2 inputs, 4 actions in a grid of 9x9 03/11 Implementation of Pushdown Automaton for toy language recognition; 03/12 Algorithm for a^n b^m a^n b^m e.g. aaabbaaabb by Linear Bounded Automaton 03/12 Implementation of Linear Bounded Automaton for a^n b^n c^n 03/13 Implementation of Turing Machine for a^{2^n} 03/14 Implementation of Turing Machine for a^n b^n, a^n b^n c^n and parindrom on {0, 1} ================================================================================================