Lessons Write a review Share
Exit Fullscreen Back to course
THEORY OF COMPUTATION
    • language, alphabet, string vs word in automata theory
    • Theory of computation Bangla tutorial 59; NFA to DFA conversion example 1
    • Convert NFA to DFA with example| How to Convert NFA to DFA
    • Theory of computation Bangla tutorial, Formal definition of Regular Expression
    • Construction of Mealy Machine
    • Mealy and Moore State Machines (Part 1)
    • What is Context free grammar in TOC | Formal Definition
    • Chomsky Normal Form & CFG to CNF Conversion
    • What is Pushdown Automata in TOC | Definition & Explanation
    • Turing Machine - Introduction (Part 1)
    • Turing Machine for a^nb^n | Design Turing Machine
    • TOC(Set-1)
    • Minimization of DFA
    • CFG
    • DFA
    • NFA
    • FINITE AUTOMATA
    • PDA
    • REGULAR EXPRESSION
  • Syllabus_TOC
    • Syllabus(TOC)
  • COURSE OUTLINE(TOC)
    • TOC_Outline
  • NU Question
    • Theory of Computation Questions (2017 - 2009)