AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |
Back to Blog
![]() ![]() Ambiguity in Context free Grammar and Context free Languages.Closure Properties of Context Free Languages.DFA machines accepting odd number of 0’s or/and even number of 1’s.DFA of a string with at least two 0’s and at least two 1’s.Designing Deterministic Finite Automata (Set 2).Designing Deterministic Finite Automata (Set 1).Union and Intersection of Regular languages with CFL.Generating regular expression from Finite Automata.Program to Implement NFA with epsilon move to DFA Conversion.Designing Finite Automata from Regular Expression (Set 1).How to identify if a language is regular or not.Arden’s Theorem in Theory of Computation.Regular Expressions, Regular Grammar and Regular Languages.Chomsky Hierarchy in Theory of Computation.Theory Of Computation and Automata Tutorials.Regular expression, languages, grammar and finite automata ISRO CS Syllabus for Scientist/Engineer Exam.ISRO CS Original Papers and Official Keys.GATE CS Original Papers and Official Keys. ![]()
0 Comments
Read More
Leave a Reply. |