Description
Topic in Theory of Computation
Regular Expressions
- Properties of Regular Expressions
- Arden’s Theorem
Finite Automata
- Finding the minimum number of states
- Minimizing a DFA
- NFA to DFA conversion
- Complementing a DFA
- Reversing a DFA
- Myhill – Nerode Theorem
- Pumping Lemma for Regular Languages
- Compound Automata
- Mealy and Moore Machines
Languages
- Identifying regular
- Identifying CFL
- Identifying DCFL
- Identifying CSL
Grammars
- 4 types of grammars
- Chomsky Normal Form
- Ambiguity Test
Properties
- Closure Properties
- Decidable Properties
Reviews
There are no reviews yet.