Course aims:

Acquiring fundamental knowledge on the concept of mathematical modeling, the mathematical models, deterministic scheduling and implementation of a computer language;
Formation of skills necessary to solve complex problems by interpreting expressions and instructions of a programming language.
Identification of appropriate models and methods for solving real-life problems.

Course Entry Requirements:

• Fundamental knowledge in computer operation.

Course contents:

The course covers the following main topics: • mathematical principles for formal languages theory • grammars and formal language • finite automation accounting • regular expressions • grammars and regular expressions • grammars and independent content language • automate • compilation theory elements

Teaching methods:

Lecture, conversation, exemplification, exercises.

Learning outcomes:

C4.1 Defining of basic concepts and principles of computer science and mathematical theories and models. C4.2Interpretation of mathematical and informatics models (formal). C4.3 Identifying the adequate models and methods to solve real problems. C4.4 Using simulation to study the behavior patterns made and performance evaluation. C4.5 Using of formal models in specific applications for various fields.

Learning outcomes verification and assessment criteria:

Projects/Assignments –60%; continuous assessment – 40%.

Recommended reading:

A. A. Puntambekar, Formal Language & Automata Theory, Technical Publications Pune, Amit Residency, 412, Shaniver Peth, Pune, India, India, 2008, -.
Keijo Ruohonen, Formal language, http://math.tut.fi/~ruohonen/FL.pdf, -.
K. V. N. Sunitha, N. Kalyani, Formal Language and Automata Theory, Typeset at Bukprint, India, India, -.
A. M. Natarajan, A. Tamilarasi, P. Balasubramani, Theory of Automata & Formal Languages, New Age International Publishers., India,