A Theory of Computation syllabus for a B.Tech course typically covers automata theory, formal languages, computability, and computational complexity. It often includes topics like finite automata, regular expressions, context-free grammars, pushdown automata, Turing machines, and undecidability. While there isn't one single definitive "pdf" syllabus, you can find various resources online, including sample syllabi and lecture notes from universities, that outline the core topics. 

1. Automata Theory and Formal Languages:

• Finite Automata: Deterministic (DFA) and Non-deterministic (NFA) Finite Automata, their properties, and how they recognize languages. 
• Regular Expressions: Definition, operators, equivalence with finite automata, and applications. 
• Regular Languages: Closure properties, pumping lemma for regular languages, and decidability. 
• Context-Free Grammars (CFG): Definition, derivation trees, ambiguity, normal forms (CNF, GNF), and pumping lemma for context-free languages. 
• Pushdown Automata (PDA): Definition, acceptance of languages, and equivalence with CFGs. 

2. Computability Theory:

• Turing Machines:
  Formal definition, languages accepted by Turing machines, and their role as computers.
• Undecidability:
  Introduction to the concept of undecidable problems and examples like the halting problem. 

3. Computational Complexity:

• (May be introduced at a higher level): Basic concepts of complexity classes (e.g., P, NP) and their relationship to decidability.