HingLearn Logo

Theory of computation (TOC)

Theory of Computation (TOC) Computer Science ka ek important subject hai jo computation ke mathematical concepts ko samjhata hai. Ismein Automata, Regular Expressions, CFG, PDA aur Turing Machines jaise topics cover kiye jaate hain. TOC programming languages, compilers aur algorithms ki foundation ko strong banata hai.

16 topic articles · GFG-style ordered list

Theory of computation (TOC) — Articles

  1. 1Complexity Theory (TOC)
  2. 2FINITE AUTOMATA
  3. 3Basic Concepts and Automata Theory
  4. 4Complexity Theory
  5. 5NON-DETERMINISTIC FINITE AUTOMATA
  6. 6Equivalence of NFAs and DFAs
  7. 7Myhill–Nerode Theorem
  8. 8Mealy and Moore Machines in TOC
  9. 9Minimization of DFA in TOC
  10. 10NFA- NON DETERMINISTIC FINITE AUTOMATA
  11. 11Simulating a Deterministic Finite Automaton (DFA) and a Non-Deterministic Finite Automaton (NFA) in TOC
  12. 12Regular Expression
  13. 13Kleene's Theorem
  14. 14Arden's Theorem in TOC
  15. 15Pumping Lemma for Regular Languages
  16. 16Regular Languages ki Decidability aur Decision Properties