Automata and Language Theory
Learning Outcomes
On successful completion of this course, student will be able to: Define the theory of automata and grammar in a formal language; Explain the theory of automata and formal language; Apply the theory of automata and formal language
Topics
- Automata: The Methods and The Madness
- Regular Expression
- Deterministic Finite Automata
- Non-Deterministic Finite Automata
- NFA with Empty String Transition
- Minimization of Finite State Automata
- Automata with Output
- Context Free Language
- Ambiguous Grammar
- Chomsky Normal Form
- Greibach Normal Form
- Push Down Automata
- Non-Deterministic Push Down Automata
- Properties or Characteristics of Regular Language and Context Free Language
SOCIAL MEDIA
Let’s relentlessly connected and get caught up each other.
Looking for tweets ...