18. Five Days Faculty Development Program on Formal Language & Automata Theory And Compiler Design held on JAN 23 – 27, 2012. Resources person of this workshop are Dr. Kamala Keerthivasan ,Dept. of CSE, IITM, Dr. Ramadevi, Dept. of CSE, IITM, Dr. Ravi Kumar, Wipro Technologies, Prof. B.I Khodanpur, Dept. of CSE, RNSIT, Mrs. Kaveri, Prof. Dept. of CSE, RVCE
The five days’ workshop is intended to provide the basic concepts and hands on training on the formal language and finite automata theory Viz. –Deterministic pushdown automata (DPA), Linear bounded automaton(LBA), Turing machine, Nondeterministic/Deterministic Finite state machine(FSM), Nondeterministic automaton, and the Deterministic Büchi automaton. Understanding and use of these tools will facilitate the students and faculties of ISE, CSE, ECE and TCE branches in the design and implementation of BE / M.Tech students project work.
The Automata theory is the study of abstract machines and automata, as well as the computational problems that can be solved using them. It is a theory in theoretical computer science, under Discrete mathematics.Automata theory is also closely related to formal language theory. An automaton is a finite representation of a formal language that may be an infinite set. Finite-state machines can model a large number of problems, among which are electronic design automation, communication protocol design, language parsing and other engineering applications. In biology and artificial intelligence research, state machines or hierarchies of state machines have been used to describe neurological systems and in linguistics—to describe the grammars of natural languages.. Turing machine can be adapted to simulate the logic of any computer algorithm, and is particularly useful in explaining the functions of a CPU inside a computer