Course module

Theory Of Computation — HPSC PGT Computer Science

Lessons
163
Duration
15 hr 52 min
PYQs
24
Practice
695

1% of this course's PYQ weight is covered in this module.

Syllabus index

Lessons in this module

Introduction to TOC

Deterministic FA (DFA)

DFA Construction & Design

  1. DFA Designing where L={a}Drm Video
  2. DFA Designing where starts with substring sDrm Video
  3. DFA Designing where string ends with substring ‘s’Drm Video
  4. DFA Designing string contains sub string sDrm Video
  5. DFA Designing string start and end with aDrm Video
  6. Practice Question LanguageDrm Video
  7. DFA Designing string start and end with same symbolDrm Video
  8. DFA Designing string start and end with different symbolDrm Video
  9. DFA Designing where starts with s = aaa or bbbDrm Video
  10. DFA Designing string ends with s = aaa or bbbDrm Video
  11. DFA Designing sting with substring s = aaa or bbbDrm Video
  12. Practice Questions LanguageDrm Video
  13. DFA Designing sting where |w| = 3, |w| <= 3, |w| >= 3Drm Video
  14. DFA Designing sting where number of a = 2Drm Video
  15. DFA Designing sting where number of a >= 2Drm Video
  16. DFA Designing sting where |w|=0(mod3), |w|=1(mod4)Drm Video
  17. DFA Designing sting where number of a =0(mod3)Drm Video
  18. 720p _ 19.1 Gate 2015Drm Video
  19. Practice Questions DFADrm Video
  20. DFA Designing sting where odd occurance of subsring 'ab'Drm Video
  21. DFA Designing sting where even occurance of subsring 'baa'Drm Video
  22. How Many Different DFA's Can Be Designed Part-1Drm Video
  23. How Many Different DFA's Can Be Designed Part-2Drm Video
  24. Empty Language AcceptanceDrm Video
  25. Universal Language AcceptanceDrm Video
  26. DFA Designing where string contain b as 2nd symbol from leftDrm Video
  27. DFA Designing where string contain b as 2nd symbol fromRightDrm Video
  28. DFA Designing where string start with a and w=omod3Drm Video
  29. DFA Designing where string contain even number of a and bDrm Video
  30. |a|= 0(mod2) |b|= 0(mod3) |c|= 0(mod5)Drm Video
  31. DFA Design For String Has a DecimalDrm Video
  32. Design DFA for Language Part-1Drm Video
  33. Design DFA for Language Part-2Drm Video
  34. Design DFA for Language Part-3Drm Video
  35. Design DFA for Language Part-4Drm Video

Non-Deterministic FA

Regular Expressions

Grammar

Regular Language Properties

Pushdown Automata & CFG

Context-Free Grammars

  1. Linear GrammarDrm Video

Turing Machines

Module lessons

Previous-year questions

PYQ collectionPYQ Questions1 questionsPYQ collectionPYQ Questions1 questionsPYQ collectionPYQ Questions2 questionsPYQ collectionPYQ Questions3 questionsPYQ collectionPYQ Questions5 questionsPYQ collectionPYQ Questions1 questionsPYQ collectionPYQ Questions2 questionsPYQ collectionPYQ Questions1 questionsPYQ collectionPYQ Questions4 questionsPYQ collectionPYQ Questions2 questionsPYQ collectionPYQ Questions1 questionsPYQ collectionPYQ Questions3 questionsPYQ collectionPYQ Questions4 questionsPYQ collectionPYQ Questions4 questionsPYQ collectionPYQ Questions1 questionsPYQ collectionPYQ Questions1 questionsPYQ collectionPYQ Questions2 questionsPYQ collectionPYQ Questions1 questionsPYQ collectionPYQ Questions2 questionsPYQ collectionPYQ Questions3 questionsPYQ collectionPYQ Questions1 questionsPYQ collectionPYQ Questions1 questionsPYQ collectionPYQ Questions1 questionsPYQ collectionPYQ Questions1 questionsPYQ collectionPYQ Questions24 questions

Explore the course

Previous moduleDigital Logic & CircuitsNext moduleCompiler Design
View course details
Loading lesson…