Automata Theory and Formal Languages

Back to Note Overview
tags: AutomataTheoryandFormalLanguages 110-1 選修 CSIE NTNU

Ch.01 Introduction to the theory of computation

Ch.02 Finite automata

Ch.03 Regular languages and regular grammars

Ch.04 Properties of regular languages

Ch.05 Conotext-Free languages (CFL)

Ch.06 Simplification of context-free grammars and normal forms

Ch.07 Pushdown automata (PdA)

Ch.08 Properties of context-free languages

Ch.09 Turing machine