GATE CS 2016 Sec 6
Theory of Computation
Finite Automata | Introduction
Chomsky Hierarchy
Pumping Lemma
Recommended Posts:
- GATE Cut-offs needed to get into IITs, NITs, etc
- Top 5 Topics for Each Section of GATE CS Syllabus
- How to prepare in Last 10 days to score high in GATE?
- How to solve Relational Algebra problems for GATE
- Previous Year Gate CSE/IT papers with solutions
- GATE CS 2015
- GATE CS 2014
- GATE CS 2016 Sec 5 - Searching
- GATE CS 2016 Sec 5 - Sorting
- GATE CS 2016 Sec 5 - Hashing
- GATE CS 2016 Sec 5 – Time Space Complexity
- GATE CS 2016 Sec 5 – Greedy
- GATE CS 2016 Sec 5 – Dynamic Programming
- GATE CS 2016 Sec 5 – Divide and Conquer
- GATE CS 2016 Sec 4 – Arrays
