-
Course Overview
This Course is Only Available On Our App
Dive-in and start learning! Get offline access to all the course contents!
No items in this section -
Theoretical Computer Science
- 1. Introduction to Finite State Machine-002
- 2. Finite State Machine Problem No. 1-001
- 3. Finite State Machine Problem No. 2-003
- 4. Finite State Machine Problem No. 3-004
- 5. Introduction to Deterministic Finite Automata ( DFA )
- 6. Deterministic Finite Automata ( DFA ) Problem No. 1 ( Updated )
- 7. Deterministic Finite Automata ( DFA ) Problem No. 2
- 8. Deterministic Finite Automata ( DFA ) Problem No. 3
- 9. Deterministic Finite Automata ( DFA ) Problem No. 4
- 10. Regula Expression and Regular Language
- 11. Operations on Language
- 12. Regular Expression to Regular Language
- 13. Regular Language to Regular Expression
- 14. Understanding the flow
- 15. RE to NFA with Epselon Transition using Thompsons COnstruction Method
- 16. RE to NFA with Epselon transition using Thompson’s Construction Method ( Part 2 )
- 17. RLRE to Minimised DFA ( Direct Method )
- 18. RLRE to Minimised DFA ( Imp State Method )
- 19. Convert NFA with E-Transition to NFA without E-Transition
- 20. NFA Without E-Transition to DFA
- 21. Moore & Mealy Machine
- 22. Moore & Mealy Machine ( Problem 1 )
- 23. Introduction to Grammar
- 24. RE – RL to Context Free Grammar
- 25. How to Convert RE RL to Context Free Grammar
- 26. LMD RMD & Parse Tree
- 27. Check whether the given grammar is an ambiguous grammar or not
- 28. Elimination of useless variable
- 29. Elimination of Null Production
- 30. Elimination of unit Production
- 31. Simplification of CFG
- 32. Introduction to Chomsky Normal Form
- 33. CFG to CNF ( Problem No. 1 )-004
- 34. CFG to CNF ( Problem No. 2 )
- 35. CFG to CNF ( Problem No. 3 )-002
- 36. Introduction to Greibach Normal Form ( GNF )
- 37. Convert CFG to GNF ( Problem No. 1 )
- 38. Convert CFG to GNF ( Problem No. 2 )
- 39. Convert CFG to GNF ( Problem No. 3 )
- 40. Convert the following into CNF & GNF
- 41. Introduction to Push Down Automata–
- 42. How to write commands in Push Down Automata–
- 43. Push Down Automata ( Problem No. 1 )–
- 44. Introduction to Turing Machine–
- 45. Convert FA ( DFA ) to PDA–
- 46. Convert CFG to PDA–
- 47. Post Currospondance Problem ( PCP )–
-
Theoretical Computer Science [Notes]:-
This content is protected, please login and enroll course to view this content!
Prev
GRAMMARS
Next
TURING MACHINE