GATE 2010 Syllabus for Computer Science and Engineering
Theory of Computation: Regular languages and finite automata, Context free languages and Push-down automata, Recursively enumerable sets and Turing machines, Undecidability; NPcompleteness.
Digital ...