RavindraBabu Ravula - GATE - 2021 - Theory of Computation - CoursesGhar
- 收录时间:2022-01-16 06:29:25
- 文件大小:8GB
- 下载次数:1
- 最近下载:2022-01-16 06:29:25
- 磁力链接:
-
文件列表
- 10.Grammars/7.CYK algorithm example 1 using CNF.m4v 233MB
- 13.Turing machines/11.Modifications to standard TM.mp4 219MB
- 2.DFA/1.Introduction to TOC and DFA.mkv 197MB
- 2.DFA/2.Construction of minimal DFA and problems.mkv 174MB
- 15.Computability and decidability/1.Introduction to computability and decidability.mp4 172MB
- 11.PDA/4.Non deterministic PDA.mkv 170MB
- 8.Regular Expressions and Conversions/4.Conversion of Finite automata to Regular Expression and vice versa.mkv 167MB
- 10.Grammars/6.CNF introduction.m4v 161MB
- 14.Countability/1.Introduction to countable sets.m4v 158MB
- 13.Turing machines/2.Turing machine example 2.m4v 154MB
- 9.Testing whether a language is regular/1.Testing whether a language is regular or not.mkv 150MB
- 10.Grammars/1.introduction to grammars.mkv 147MB
- 11.PDA/3.Examples on PDA.mkv 141MB
- 11.PDA/5.Testing CFG or not.mkv 139MB
- 15.Computability and decidability/2.TM halting problem Page.mp4 138MB
- 13.Turing machines/1.Turing machine example.m4v 137MB
- 13.Turing machines/13.Linear bounded automata(LBA).mp4 130MB
- 2.DFA/32.DFA Union,Concatenation, Cross product, Complementaion,Reversal.mkv 126MB
- 13.Turing machines/19.Important theorem on recursive and RE languages.mp4 125MB
- 11.PDA/2.introduction to PDA and examples.mkv 125MB
- 15.Computability and decidability/5.P and NP problems.mp4 123MB
- 10.Grammars/4.Elimination of epsilon unit productions and useless symbols from CFG.mkv 117MB
- 10.Grammars/3.Types of grammars and problems on linear grammar and context free grammars.mkv 117MB
- 13.Turing machines/12.universal TM and encoding of TM.mp4 114MB
- 13.Turing machines/6.TM as comparator.mp4 107MB
- 19.Gate questions on TM and undecidability/11.Question 10.mp4 107MB
- 19.Gate questions on TM and undecidability/5.Question 5.mp4 104MB
- 8.Regular Expressions and Conversions/3.Examples of Regular expressions and identities of RE.mkv 103MB
- 14.Countability/7.Diagnolization method to prove that set of all languages are uncountable.mp4 103MB
- 10.Grammars/8.CYK algorithm example 2 using CNF.mp4 97MB
- 13.Turing machines/17.Context sensitive grammars example 1.mp4 95MB
- 10.Grammars/9.GNF introduction and conversion of CFG to PDA.mp4 92MB
- 8.Regular Expressions and Conversions/2.Examples of Regular expressions.mkv 90MB
- 4.Minimisation of DFA/1.Minimization of DFA.mkv 88MB
- 13.Turing machines/14.Recursively enumerable and recursive languages.mp4 85MB
- 17.Properties of Regular Languages/4.RL are closed under inverse homomorphism.mp4 82MB
- 13.Turing machines/10.Turing thesis.mp4 81MB
- 13.Turing machines/18.Context sensitive grammars example 2.mp4 76MB
- 14.Countability/2.Alternative definition of countability.m4v 74MB
- 4.Minimisation of DFA/2.Minimization of DFA.mkv 72MB
- 14.Countability/8.Some problems on countability.mp4 71MB
- 13.Turing machines/7.Definition of standard TM.mp4 71MB
- 6.Epsilon NFA/1.Epsilon NFA and conversion of epsilon NFA to NFA.mkv 68MB
- 14.Countability/4.Set of all strings over any finite alphabet are countable.mp4 67MB
- 19.Gate questions on TM and undecidability/19.Question 18.mp4 65MB
- 2.DFA/6.DFA construction of binary no which is divisible by 2 and number system.mkv 64MB
- 9.Testing whether a language is regular/2.Pumping lemma for regular languages.mp4 64MB
- 13.Turing machines/5.TM as adder.m4v 59MB
- 17.Properties of Regular Languages/1.RL are closed under union intersection concatenation complementation and kleene closure.mp4 58MB
- 3.NFA/5.convertion of NFA to DFA.mkv 58MB
- 13.Turing machines/15.The big picture Page.mp4 58MB
- 2.DFA/3.Construction of DFA and cross product of DFA.mkv 55MB
- 15.Computability and decidability/6.Decidability table.mp4 55MB
- 3.NFA/1.Introduction to NFA.mkv 55MB
- 13.Turing machines/3.TM as transducer of 1s copmplement.m4v 55MB
- 16.Properties of CFLs/2.CFG are not closed under intersection and complementation.m4v 53MB
- 14.Countability/3.set of all quotients are countable.mp4 51MB
- 13.Turing machines/16.Unrestricted grammars.mp4 51MB
- 2.DFA/8.DFA of binary no divisible by 4.mkv 51MB
- 13.Turing machines/4.TM as transducer for computing 2s complement.m4v 51MB
- 19.Gate questions on TM and undecidability/20.Question 19.mp4 48MB
- 13.Turing machines/8.TM as copier.mp4 47MB
- 15.Computability and decidability/3.Some undecidable problems based on TM halting problem.mp4 44MB
- 3.NFA/8.Complementation of NFA.mkv 44MB
- 13.Turing machines/9.Non-halting TM.mp4 43MB
- 7.Families of Formal Languages/1.families of languages.mkv 42MB
- 18.Decidable problems on Regular Languages/2.infiniteness problem is decidable.mp4 41MB
- 5.Moore and Mealy/6.Examples of Mealy machine.mkv 40MB
- 15.Computability and decidability/4.PC problem.mp4 40MB
- 12.testing whether language is context free language/1.Pumping lemma for context free languages.mp4 40MB
- 14.Countability/6.Implications of the fact that the Turing Machines are countable.mp4 39MB
- 19.Gate questions on TM and undecidability/10.Question 9.mp4 39MB
- 19.Gate questions on TM and undecidability/13.Question 12.mp4 37MB
- 2.DFA/4.DFA and problem.mkv 37MB
- 2.DFA/31.Raudra Eduservices - DFA which accepts strings of form a^3bwa^3 , where w is any string.mkv 37MB
- 19.Gate questions on TM and undecidability/17.Question 16.mp4 36MB
- 14.Countability/5.Set of all Turing machines are countable.mp4 34MB
- 17.Properties of Regular Languages/5.RL are closed under quotient operation.mp4 34MB
- 2.DFA/7.DFA of binary no which is divisible by 3.mkv 34MB
- 19.Gate questions on TM and undecidability/4.Question 4.mp4 33MB
- 5.Moore and Mealy/10.Conversion of Mealy machine to Moore machine.mkv 33MB
- 5.Moore and Mealy/1.Moore Machine and Mealy machine.mkv 33MB
- 5.Moore and Mealy/8.Conversion of Moore machine to Mealy machine.mkv 32MB
- 8.Regular Expressions and Conversions/1.Introduction to Regular Expressions.mkv 32MB
- 19.Gate questions on TM and undecidability/6.Question 6.mp4 31MB
- 6.Epsilon NFA/2.Conversion of epsilon NFA to NFA.mkv 31MB
- 16.Properties of CFLs/1.CFLs are closed under unionconcat and kleene closure.m4v 30MB
- 2.DFA/18.DFA which accepts string starting and ending with same symbol.mkv 30MB
- 2.DFA/35.No.of 2 state DFAs with a designated initial state accepting the empty language over ab.m4v 30MB
- 3.NFA/6.convertion of NFA to DFA.mkv 29MB
- 2.DFA/5.DFA construction.mkv 29MB
- 18.Decidable problems on Regular Languages/1.emptiness problem is decidable.mp4 27MB
- 17.Properties of Regular Languages/3.RL are closed under Homomorphism.mp4 26MB
- 17.Properties of Regular Languages/6.RL are closed under INIT operation.mp4 26MB
- 16.Properties of CFLs/3.Decidable problems on CFLS.mp4 26MB
- 19.Gate questions on TM and undecidability/12.Question 11.mp4 26MB
- 19.Gate questions on TM and undecidability/18.Question 17.mp4 26MB
- 5.Moore and Mealy/5.Examples of Moore machine_4.mkv 24MB
- 5.Moore and Mealy/4.Examples of Moore machine_3.mkv 23MB
- 2.DFA/36.No.of 2 state DFAs with a designated initial accepting the universal language over ab.mp4 22MB
- 2.DFA/16.DFA problem and concatenation of DFA.mkv 22MB
- 3.NFA/4.Conversion of NFA to DFA.mkv 22MB
- 19.Gate questions on TM and undecidability/8.Question 7.mp4 22MB
- 2.DFA/34.No.of 2 state DFAs with a designated initial and final state over ab.m4v 21MB
- 2.DFA/17.DFA which accepts string starting and ending with different sysmbol.mkv 21MB
- 5.Moore and Mealy/2.Examples of Moore machine.mkv 21MB
- 18.Decidable problems on Regular Languages/3.equality problem is decidable.mp4 21MB
- 3.NFA/3.Conversion of NFA to DFA.mkv 21MB
- 5.Moore and Mealy/11.Conversion of Mealy machine to Moore machine_2.mkv 21MB
- 5.Moore and Mealy/9.Conversion of Moore machine to Mealy machine_2.mkv 20MB
- 19.Gate questions on TM and undecidability/14.Question 13.mp4 20MB
- 17.Properties of Regular Languages/2.RL are closed under difference and reversal.mp4 19MB
- 4.Minimisation of DFA/4.Minimization of DFA.mkv 19MB
- 4.Minimisation of DFA/5.Minimization of DFA.mkv 19MB
- 3.NFA/2.Examples of NFA.mkv 19MB
- 2.DFA/27.DFA which accepts strings={ a^nb^m c^l- n,m,l greater than or equal to1}.mkv 19MB
- 17.Properties of Regular Languages/8.RL are not closed under infinite union.mp4 19MB
- 5.Moore and Mealy/3.Examples of Moore machine_2.mkv 18MB
- 2.DFA/23.DFA which accepts strings in which every a is followed by bb.mkv 18MB
- 2.DFA/38.No.of n state DFAs with a designated initial state over alphabet containing m symbols.mp4 17MB
- 2.DFA/19.Complementation of DFA.mkv 17MB
- 3.NFA/7.Examples to construct NFA.mkv 17MB
- 19.Gate questions on TM and undecidability/1.Question 1.mp4 17MB
- 19.Gate questions on TM and undecidability/22.Question 21.mp4 16MB
- 19.Gate questions on TM and undecidability/16.Question 15.mp4 16MB
- 2.DFA/33.Problems of DFA.mkv 16MB
- 2.DFA/28.DFA which accepts strings={ a^nb^mc^l_n,m,l greater than equal to 0}.mkv 16MB
- 2.DFA/37.No.of 3 state DFAs with a designated initial state over ab.mp4 16MB
- 2.DFA/24.DFA which accepts strings in which every a is never be followed by bb.mkv 16MB
- 2.DFA/30.DFA which accepts strings such that 2nd symbol from LHS is a.mkv 15MB
- 19.Gate questions on TM and undecidability/21.Question 20.mp4 15MB
- 4.Minimisation of DFA/3.Minimization of DFA.mkv 15MB
- 2.DFA/14.DFA of strings containing ab as substring.mkv 15MB
- 19.Gate questions on TM and undecidability/9.Question 8.mp4 14MB
- 5.Moore and Mealy/7.Examples of Mealy machine_2.mkv 14MB
- 19.Gate questions on TM and undecidability/2.Question 2.mp4 14MB
- 17.Properties of Regular Languages/7.RL are closed under substitution.mp4 14MB
- 2.DFA/21.DFA which accepts strings in which every a is never be followed by b.mkv 14MB
- 2.DFA/15.DFA of strings which ends with ab.mkv 14MB
- 2.DFA/11.DFA of strings which ends with a.mkv 13MB
- 19.Gate questions on TM and undecidability/3.Question 3.mp4 13MB
- 2.DFA/10.DFA of strings which contains a.mkv 13MB
- 2.DFA/9.DFA of strings which starts with a.mkv 13MB
- 2.DFA/20.DFA which accepts strings in which every a is followed by b.mkv 13MB
- 2.DFA/13.DFA of strings which starts with ab.mkv 12MB
- 2.DFA/12.Comparison between different DFAs.mkv 11MB
- 2.DFA/25.DFA which accepts strings= { a^nb^m - n,m greater than or equal to 1}.mkv 11MB
- 2.DFA/26.DFA which accepts strings={ a^nb^m - n,m greater than or equal to 0}.mkv 10MB
- 19.Gate questions on TM and undecidability/15.Question 14.mp4 8MB
- 2.DFA/29.DFA which accepts strings=a^nb^mc^l_n,m,l greater than equal to 0}.mkv 5MB
- 20.Practice Questions/23.Solutions Set-6.pdf 798KB
- 20.Practice Questions/34.Solutions Set-17.pdf 715KB
- 20.Practice Questions/20.Solutions Set-3.pdf 684KB
- 20.Practice Questions/22.Solutions Set-5.pdf 678KB
- 20.Practice Questions/29.Solutions Set-12.pdf 638KB
- 20.Practice Questions/30.Solutions Set-13.pdf 564KB
- 20.Practice Questions/25.Solutions Set-8.pdf 544KB
- 20.Practice Questions/27.Solutions Set-10.pdf 513KB
- 20.Practice Questions/17.Practice Questions Set-17.pdf 498KB
- 20.Practice Questions/21.Solutions Set-4.pdf 492KB
- 20.Practice Questions/28.Solutions Set-11.pdf 466KB
- 20.Practice Questions/16.Practice Questions Set-16.pdf 459KB
- 20.Practice Questions/8.Practice Questions Set-8.pdf 440KB
- 20.Practice Questions/24.Solutions Set-7.pdf 432KB
- 20.Practice Questions/6.Practice Questions Set-6.pdf 431KB
- 20.Practice Questions/3.Practice Questions Set-3.pdf 420KB
- 20.Practice Questions/4.Practice Questions Set-4.pdf 409KB
- 20.Practice Questions/11.Practice Questions Set-11.pdf 407KB
- 20.Practice Questions/5.Practice Questions Set-5.pdf 407KB
- 20.Practice Questions/7.Practice Questions Set-7.pdf 403KB
- 20.Practice Questions/10.Practice Questions Set-10.pdf 400KB
- 20.Practice Questions/32.Solutions Set-15.pdf 398KB
- 20.Practice Questions/13.Practice Questions Set-13.pdf 356KB
- 20.Practice Questions/31.Solutions Set-14.pdf 347KB
- 20.Practice Questions/15.Practice Questions Set-15.pdf 331KB
- 20.Practice Questions/14.Practice Questions Set-14.pdf 327KB
- 20.Practice Questions/33.Solutions Set-16.pdf 302KB
- 10.Grammars/5.Note Small mistake in below video.png 267KB
- 16.Properties of CFLs/4.Closure Properties Table.pdf 266KB
- 1.Instruction Note/1.Read Me First.pdf 240KB
- 20.Practice Questions/26.Solutions Set-9.pdf 228KB
- 20.Practice Questions/12.Practice Questions Set-12.pdf 216KB
- 20.Practice Questions/18.Solutions Set-1.pdf 198KB
- 2.DFA/22.Note Small mistake in below video.pdf 167KB
- 20.Practice Questions/19.Solutions Set-2.docx 163KB
- 20.Practice Questions/9.Practice Questions Set-9.pdf 145KB
- 11.PDA/1.Before watching below video Please click here and check this.png 103KB
- 20.Practice Questions/1.Practice Questions Set-1.docx 86KB
- 10.Grammars/2.Small Mistake in Below video. Please click to know details..png 48KB
- 20.Practice Questions/2.Practice Questions Set-2.docx 34KB
- Uploaded by [Coursesghar.com].txt 1KB
- [TGx]Downloaded from torrentgalaxy.to .txt 564B
- !! IMPORTANT Note !!.txt 287B
- !!! Please Support !!! [CoursesGhar.Com].txt 197B
- telegram @coursesghargate.url 128B
- Visit coursesghar.com for more awesome tutorials.url 114B