Automata Theory involves study of Abstract Mathematical representation of computational devices having varied organization and formally prove their capability of solving certain categories of computational problems.
We start with learning about the abstraction called as Language (Formal Language) Which is used by researchers to categorize computational problems into 4 categories Regular, Context Free, Context Sensitive, Recursively Enumerable. We also dedicate our attention to mathematical devices called as FA, PDA, TM.
- Teacher: Admin User