120 likes | 245 Views
Review. June 25 th 2pm-4pm 逸夫馆 B205. Review. Finite Automata & Regular Expression DFA, NFA, ε - NFA, RE Definition, Language, Transformation Decision & Closure Properties Pumping Lemma. Context Free Grammar Definition, Derivation, Leftmost, Rightmost… Parse Tree
E N D
June 25th 2pm-4pm • 逸夫馆 B205
Review • Finite Automata & Regular Expression • DFA, NFA, ε-NFA, RE • Definition, Language, Transformation • Decision & Closure Properties • Pumping Lemma
Context Free Grammar • Definition, Derivation, Leftmost, Rightmost… • Parse Tree • Clean Up, Chomsky Normal Form • Decision & Closure Properties • Pumping Lemma
Pushdown Automata • Definition • Final state,Empty stack,Transformation • RE, DPDA, NPDA • PDA & CFG
Turing Machine • Definition • Behavior • TM Programming • Extensions • Recursive Language、Recursively Enumerable Language • P、NP、NPC
Transition System • Semantic Basis • Definition • Equivalence • CTL* • Model a real system!
Petri Net • Concurrency • TokenGame • Model a concurrency System • Relation Between PN and TS
Timed Automata & Hybrid Automata • Definition • Continuous time domain • Difference between TA & HA • When should we use such model?
Message Sequence Chart • Definition • Graphical and Textual Presentation • Semantic • Casual Order & Race • HMSC