MCTA015-13 Formal Languages and Automata (3-1-4)
Syllabus:
Basic definitions. Regular languages: deterministic and non-deterministic finite automata. Regular
expressions. Context free grammars, push down automata. Turing-recognizable languages: deterministic and
non-deterministic Turing machines.
Undecidability: the halting problem.
Complexity: definition of the classes P and NP.
Recommendation:
Structured Programming.
Required texts:
●
●
●
SIPSER, M. Introduction to the Theory of Computation. Course Technology; 2nd edition, 2005. (ISBN:
0534950973, ISBN-13: 978-0534950972)
HOPCROFT, J. E.; ULLMAN, D. J.; MOTWANI, R. Introduction to Automata Theory, Languages, and
Computation. Addison Wesley; 3rd edition, 2006. (ISBN: 0321462254, ISBN13: 978-0321462251)
LEWIS, H. R.; PAPADIMITRIOU, C. H. Elements of the Theory of Computation. Pearson. 2nd edition, 1997.
(ISBN: 0132624788, ISBN13: 978-0132624787)
Additional texts:
●
YAN, S. Y. “An Introduction to Formal Languages and Machine Computation”, World Scientific Publishing
Company, 1996. (ISBN: 9810234228, ISBN-13: 978-981-02-3422-5)
● RICH, E. A. “Automata, Computability and Complexity: Theory and Applications”, Prentice Hall; 1st edition,
2007. (ISBN: 0132288060, ISBN-13: 978-0-13-228806-4)
● ANDERSON, J. “Automata Theory with Modern Applications”, Cambridge University Press, 2006. (ISBN:
0521848873, ISBN-13: 978-0-521-84887-9)
● SHALLIT, J. “A Second Course in Formal Languages and Automata Theory”, Cambridge University Press, 1st
edition, 2008. (ISBN: 0521865727, ISBN-13: 978-0-521-86572-2)
● SALOMAA, A. Computation and automata. Cambridge, UK: Cambridge University Press, 1985.
Further reading:
●
SAKAROVITCH, J. “Elements of Automata Theory”, Cambridge University Press, 2009. (ISBN-13: 978-0-52184425-3)