Formal Language & Automata Theory (CB-301)-Computer Science and Business System (III) | RGPV

---

• Syllabus

• Syllabus - Formal Language & Automata Theory (CB-301)

• Unit 1: Introduction

• Introduction to Formal Language
• Regular languages and finite automata

• Unit 2: Context-free languages and pushdown automata

• Context-free languages and pushdown automata

• Unit 3: Context-sensitive languages

• Context-sensitive languages

• Unit 4: Turing machines

• Turing machines

• Unit 5: Undecidability

• Undecidability

• Unit 6: Basic Introduction to Complexity

• Basic Introduction to Complexity