Languages and Automata
| Numbering Code |
U-ENG29 29104 LJ10 U-ENG29 29104 LJ11 |
Year/Term | 2022 ・ Second semester | |
|---|---|---|---|---|
| Number of Credits | 2 | Course Type | Lecture | |
| Target Year | Target Student | |||
| Language | Japanese | Day/Period | Wed.1 | |
| Instructor name | YAMAMOTO AKIHIRO (Graduate School of Informatics Professor) | |||
| Outline and Purpose of the Course | We start with regular expressions and finite automata, then go to context-free grammars and pushdown automata. We learn why studying automata theory is important in computer science especially design and analysis of algorithms. | |||
| Schedule and Contents |
,1time, Finite automata,5times,Description of finite automata, minimization and regular expressions. Context-free grammars,4times,Push-down automata, context-free grammars and their equivalency. Turing machines and related issues,3times,Turing machine, its definition and basic properties. Hierarchy of languages,2times,Summary of language classes. Discussions to check the achievements of students |
|||
| Evaluation Methods and Policy | Will be specified in the lectures. | |||
| Course Requirements | None | |||
| Textbooks | Textbooks/References | Iwama, Automata, languages and theory of computation, Corona-sha, 2003 isbn{}{433901821X}. | ||
| Related URL | ||||
