Syllabus of TOC

Syllabus of TOC

Mujahida Joynab - Feb 9 -

- Dev Community

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

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .