Code |
Course Name |
Language |
Type |
BLG 311E |
Formal Languages and Automata |
English |
Compulsory |
Local Credits |
ECTS |
Theoretical |
Tutorial |
Laboratory |
3 |
5 |
3 |
0 |
0 |
Course Prerequisites and Class Restriction |
Prerequisites |
BLG 112 MIN DD or BLG 112E MIN DD
|
Class Restriction |
None |
Course Description |
Formal languages. Grammars and the Chomsky hierarchy. Regular expressions. Finite state
machines (FSM) :
Mealy and Moore models. Machine congruence and reduction of states.
Deterministic and non deterministic automata. Push down automata and context
-
free grammars.
Turing machines and computability. |
|