# Formal Languages and Automata 2021 Course number: CSIEB0190 --- <!-- .slide: data-transition="fade-in convex-out" --> ## General Course Information | | | | -------- | -------- | | Meeting time | 2p.m.-5p.m. Monday| | Classroom | A331 | --- <!-- .slide: data-transition="fade-in convex-out" --> **Instructor:** - Professor Tsai - Office: C325, C320 - Office Hours: 12:00–14:00 Monday - Email: chtsai@gms.ndhu.edu.tw **Teaching Assistant Group:** - Lab. : C325 --- Web Site: http://www.elearn.ndhu.edu.tw **Prerequisites:** - CSIEB0080, Discrete Mathematics, * Introduction to Proofs * Sets * Function and relation **Required Textbook:** - An Introduction to Formal Languages and Automata (Sixth Edition). Peter Linz. - Jones & Bartlett Learning. - ISBN:1284077241 - ISBN-13: 9781284077247. - https://www.tenlong.com.tw/products/9781284077247 ---  --- ## Grading Policy: - homework assignments (all paper work) — 25% + 10% = 35% - Attendance - 15% - Midterm — 30% - ~~Final examination — 30%~~ - Final report - 20% --- ## Assignment Policy: :::warning 1. All assignments will be handed out in class and/or posted on the class homepage 2. You have roughly 7 days for each homework assignment. 3. Submit your homework assignments to TA before the lecture on the due date begins. 4. Write legibly. What cannot be read will not be graded. 5. No late assignments will be accepted. ::: --- ::: danger Only blackboard, No slide So, please notes contents of every lesson. ::: --- ## Course Description The course introduces some fundamental concepts in automata theory and formal languages including * grammar * finite automaton * regular expression * formal language * pushdown automaton * Turing machine. --- Not only do they form basic models of computation, they are also the foundation of many branches of computer science, e.g. * compilers * software engineering * concurrent systems * etc. The properties of these models will be studied and various techniques for analyzing and comparing them will be discussed, by using both formalism and examples.