CE 409 – Formal Languages and Automata

CE 409 – Formal Languages and Automata; Weekly hours: 2+0, ECTS: 4 The course introduces some fundamental concepts in automata theory and formal languages including grammar, finite automaton, regular expression, formal language, pushdown automaton, and Turing machine. Not only do they form basic models of computation, they are also the foundation of many branches of … Continue reading CE 409 – Formal Languages and Automata