Course Features
- Lectures 53
- Quiz 0
- Duration 50 hours
- Skill level All levels
- Language English
- Students 1
- Assessments Yes
Curriculum
- 3 Sections
- 53 Lessons
- 24 Weeks
Expand all sectionsCollapse all sections
- Course Overview/*! CSS Used from: Embedded */ *, ::after, ::before { box-sizing: border-box; border-width: 0; border-style: solid; border-color: #e5e7eb; } ::after, ::before { --tw-content: ''; } h2 { font-size: inherit; font-weight: inherit; } a { color: inherit; text-decoration: inherit; } h2, p { margin: 0; } :disabled { cursor: default; } *, ::before, ::after { --tw-border-spacing-x: 0; --tw-border-spacing-y: 0; --tw-translate-x: 0; --tw-translate-y: 0; --tw-rotate: 0; --tw-skew-x: 0; --tw-skew-y: 0; --tw-scale-x: 1; --tw-scale-y: 1; --tw-scroll-snap-strictness: proximity; --tw-ring-offset-width: 0px; --tw-ring-offset-color: #fff; --tw-ring-color: rgb(59 130 246 / 0.5); --tw-ring-offset-shadow: 0 0 #0000; --tw-ring-shadow: 0 0 #0000; --tw-shadow: 0 0 #0000; --tw-shadow-colored: 0 0 #0000; } .mx-auto { margin-left: auto; margin-right: auto; } .mb-2 { margin-bottom: 0.5rem; } .mb-4 { margin-bottom: 1rem; } .mb-6 { margin-bottom: 1.5rem; } .mr-2 { margin-right: 0.5rem; } .max-w-screen-sm { max-width: 640px; } .max-w-screen-xl { max-width: 1280px; } .rounded-lg { border-radius: 0.5rem; } .bg-primary-700 { --tw-bg-opacity: 1; background-color: rgb(29 78 216 / var(--tw-bg-opacity)); } .bg-white { --tw-bg-opacity: 1; background-color: rgb(255 255 255 / var(--tw-bg-opacity)); } .px-4 { padding-left: 1rem; padding-right: 1rem; } .px-5 { padding-left: 1.25rem; padding-right: 1.25rem; } .py-2.5 { padding-top: 0.625rem; padding-bottom: 0.625rem; } .py-8 { padding-top: 2rem; padding-bottom: 2rem; } .text-center { text-align: center; } .text-4xl { font-size: 3rem; line-height: 2.5rem; } .text-sm { font-size: 0.875rem; line-height: 1.25rem; } .font-extrabold { font-weight: 800; } .font-light { font-weight: 300; } .font-medium { font-weight: 500; } .leading-tight { line-height: 1.25; } .tracking-tight { letter-spacing: -0.025em; } .text-gray-500 { --tw-text-opacity: 1; color: rgb(107 114 128 / var(--tw-text-opacity)); } .text-gray-900 { --tw-text-opacity: 1; color: rgb(17 24 39 / var(--tw-text-opacity)); } .text-white { --tw-text-opacity: 1; color: rgb(255 255 255 / var(--tw-text-opacity)); } .hover:bg-primary-800:hover { --tw-bg-opacity: 1; background-color: rgb(30 64 175 / var(--tw-bg-opacity)); } .focus:outline-none:focus { outline: 2px solid transparent; outline-offset: 2px; } .focus:ring-4:focus { --tw-ring-offset-shadow: var(--tw-ring-inset) 0 0 0 var(--tw-ring-offset-width) var(--tw-ring-offset-color); --tw-ring-shadow: var(--tw-ring-inset) 0 0 0 calc(4px + var(--tw-ring-offset-width)) var(--tw-ring-color); box-shadow: var(--tw-ring-offset-shadow), var(--tw-ring-shadow), var(--tw-shadow, 0 0 #0000); } .focus:ring-primary-300:focus { --tw-ring-opacity: 1; --tw-ring-color: rgb(147 197 253 / var(--tw-ring-opacity)); } @media (min-width: 640px) { .sm:py-16 { padding-top: 4rem; padding-bottom: 4rem; } } @media (min-width: 768px) { .md:text-lg { font-size: 1.5rem; line-height: 1.75rem; } } @media (min-width: 1024px) { .lg:px-6 { padding-left: 1.5rem; padding-right: 1.5rem; } } .imgdata { width: 35% } @media (max-width: 767px) { .imgdata { width: 40% } } .course-payment { display: none !important; } .thim-course-landing-button { display: none !important; }0
- Theoretical Computer Science47
- 2.11. Introduction to Finite State Machine-00222 Minutes
- 2.22. Finite State Machine Problem No. 1-00112 Minutes
- 2.33. Finite State Machine Problem No. 2-00312 Minutes
- 2.44. Finite State Machine Problem No. 3-00414 Minutes
- 2.55. Introduction to Deterministic Finite Automata ( DFA )18 Minutes
- 2.66. Deterministic Finite Automata ( DFA ) Problem No. 1 ( Updated )12 Minutes
- 2.77. Deterministic Finite Automata ( DFA ) Problem No. 210 Minutes
- 2.88. Deterministic Finite Automata ( DFA ) Problem No. 312 Minutes
- 2.99. Deterministic Finite Automata ( DFA ) Problem No. 49 Minutes
- 2.1010. Regula Expression and Regular Language3 Minutes
- 2.1111. Operations on Language11 Minutes
- 2.1212. Regular Expression to Regular Language6 Minutes
- 2.1313. Regular Language to Regular Expression10 Minutes
- 2.1414. Understanding the flow2 Minutes
- 2.1515. RE to NFA with Epselon Transition using Thompsons COnstruction Method16 Minutes
- 2.1616. RE to NFA with Epselon transition using Thompson’s Construction Method ( Part 2 )10 Minutes
- 2.1717. RLRE to Minimised DFA ( Direct Method )27 Minutes
- 2.1818. RLRE to Minimised DFA ( Imp State Method )24 Minutes
- 2.1919. Convert NFA with E-Transition to NFA without E-Transition16 Minutes
- 2.2020. NFA Without E-Transition to DFA19 Minutes
- 2.2121. Moore & Mealy Machine22 Minutes
- 2.2222. Moore & Mealy Machine ( Problem 1 )9 Minutes
- 2.2323. Introduction to Grammar9 Minutes
- 2.2424. RE – RL to Context Free Grammar7 Minutes
- 2.2525. How to Convert RE RL to Context Free Grammar15 Minutes
- 2.2626. LMD RMD & Parse Tree13 Minutes
- 2.2727. Check whether the given grammar is an ambiguous grammar or not7 Minutes
- 2.2828. Elimination of useless variable12 Minutes
- 2.2929. Elimination of Null Production11 Minutes
- 2.3030. Elimination of unit Production4 Minutes
- 2.3131. Simplification of CFG9 Minutes
- 2.3232. Introduction to Chomsky Normal Form9 Minutes
- 2.3333. CFG to CNF ( Problem No. 1 )-00411 Minutes
- 2.3434. CFG to CNF ( Problem No. 2 )5 Minutes
- 2.3535. CFG to CNF ( Problem No. 3 )-00212 Minutes
- 2.3636. Introduction to Greibach Normal Form ( GNF )13 Minutes
- 2.3737. Convert CFG to GNF ( Problem No. 1 )9 Minutes
- 2.3838. Convert CFG to GNF ( Problem No. 2 )7 Minutes
- 2.3939. Convert CFG to GNF ( Problem No. 3 )4 Minutes
- 2.4040. Convert the following into CNF & GNF5 Minutes
- 2.4141. Introduction to Push Down Automata–
- 2.4242. How to write commands in Push Down Automata–
- 2.4343. Push Down Automata ( Problem No. 1 )–
- 2.4444. Introduction to Turing Machine–
- 2.4545. Convert FA ( DFA ) to PDA–
- 2.4646. Convert CFG to PDA–
- 2.4747. Post Currospondance Problem ( PCP )–
- Theoretical Computer Science [Notes]:-6