Combining Turing Machines for complicated tasks.Deterministic Pushdown Automata and Deterministic Context-Free Languages.Push down Automata and Context-Free Languages.Context-Free Grammars and Programming LanguagesĬhapter five Simplification of Context-Free Grammars and Normal Forms.Connection between Regular Expressions and Regular Languages.Reducing the number of states in Finite AutomataĬhapter three Regular Languages and Regular Grammars.Equivalence of Deterministic and Non-deterministic Finite Automata.Familiar with thinking analytically and intuitively for problem-solving situations in related areas of theory in computer science.Ĭhapter one Introduction to the Theory of Computation.Prove or disprove theorems in automata theory using its properties.Design grammars and recognizers for different formal languages. Identify different formal language classes and their relationships.Acquire insights into the relationship between formal languages, formal grammars, and automata.Study the central concepts of automata theory.Introduce concepts in automata theory and theory of computation.On completion of this course students should be able to:
0 Comments
Leave a Reply. |