- Regular Language and Finite Automata (80%) -1. Language , 2. Grammar , 3. Automata(Machine)
- Context Free Language and Push down automata (10%)
- REC , RE and Turing Machine (10%)
- Closure properties and Undecidability (Very Very Important) - Table based , Decidable and Undecidable 2.- Identification - Language 3. Automata 4. Language Identification
Mujahida Joynab
Posted on
Syllabus of TOC
For further actions, you may consider blocking this person and/or reporting abuse
Top comments (0)