Understand deterministic and non-deterministic machines.Employ finite state machines to solve problems in computing.Classify machines by their power to recognize languages.Introduce the fundamental concepts of formal languages, grammars and automata theory.Provide introduction to some of the central ideas of theoretical computer science from the perspective of formal languages.The purpose of this course is to acquaint the student with an overview of the theoretical foundations of computer science from the perspective of formal languages.Īt the end of the course, the students will be able to:.Further, parts of the Automata theory have direct bearing on practice, such as Automata on circuit design, compiler design, and search algorithms Formal Languages and Grammars on compiler design and Complexity on cryptography and optimization problems in manufacturing, business, and management.
Automata Theory possesses a high degree of permanence and stability, in contrast with the ever-changing paradigms of the technology, development, and management of computer systems.
Don’t forget to underline your headings Using the research that you produced for theme designs, draw 4 differ-ent design handles. Divide your page into 4 and write the heading at the top of your page, ‘ Handle Design’.
Software for designing and checking the behaviour of digital circuits 2. Formal Languages and Automat Theory deals with the concepts of automata, formal languages, grammar, algorithms, computability, decidability, and complexity. Why Study Automata Theory Finite automata are a useful model for many important kinds of software and hardware: 1.