Converting Context Free Grammar to Greibach Normal Form. Last Minute Notes - Theory of Computation.Construct Pushdown Automata for given languages.Recursive and Recursive Enumerable Languages in TOC.Program to Implement NFA with epsilon move to DFA Conversion.Closure Properties of Context Free Languages.Closure properties of Regular languages.DFA machines accepting odd number of 0’s or/and even number of 1’s.Design 101 sequence detector (Mealy machine).How to identify if a language is regular or not.Designing Finite Automata from Regular Expression (Set 1).Generating regular expression from Finite Automata.Converting Context Free Grammar to Chomsky Normal Form.Chomsky Hierarchy in Theory of Computation.Difference between Mealy machine and Moore machine.Regular Expressions, Regular Grammar and Regular Languages.ISRO CS Syllabus for Scientist/Engineer Exam.ISRO CS Original Papers and Official Keys.GATE CS Original Papers and Official Keys.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |