Introduction
This section will introduce you to the fundamentals of TCS.
- Alphabets, Strings and Languages
- Chomskey hierarchy and Grammars
- Finite Automata (FA) and Finite State machine (FSM)
Automata Theory/TCS is the merger of discrete mathematics and abstract computer science. You will learn the mathematical models of computation such as basic machines, deterministic and non-deterministic machines, pushdown and Turing machines.
Learn the rules of the grammars that are used in computer science. Turing Machine will be dealt in greater detail with an emphasis to understand the fundamentals of its working and implementation.
This course is essential to understand the working and building of a compiler. The concepts of undecidable problems will also be made clear.
No batch is available