About Course

The goal of this course is primarily enabling students to study various automata, such as deterministic and nondeterministic finite-state machines. Study formal languages of different kinds, such as regular and context-free languages. FA helps to understand the connections between languages and automata, and related algorithms for transformations. It also provide basic results on computability, including undecidable problems such as the halting and Post correspondence problems, and their significance. It also deals with the study the basics of intractability and also connections between theoretical results and topics in practical software development, such as finite automata and regular-expression libraries. It also helps to improve programming skills, with emphasis on connections between theoretical results and practical software. Finite Automata(FA) is the simplest machine to recognize patterns. The finite automata or finite state machine is an abstract machine which has five elements or tuple. It has a set of states and rules for moving from one state to another but it depends upon the applied input symbol. Basically it is an abstract model of digital computer

Prerequisites

 Basic knowledge in Mathematics

Outcomes

After completion of this course, the student should be able to:

    * Explain, Differentiate and manipulate the different concepts in Finite automata

    * Explain the power and the limitations of regular languages.

    * Design automata, regular expressions  accepting or generating a certain language

    * Describe the language accepted by an automata or generated by a regular expression

    * Transform between equivalent deterministic and non-deterministic finite automata, and regular expressions

    * Simplify automata ,Determine if a certain word belongs to a language