Theory of Computation : Become a master of DFA
Current Status
Not Enrolled
Price
Closed
Get Started

Course Content

Introduction
Introduction to Deterministic Finite Automata (DFA)
DFA based on length of string
DFA based on modulo operator
DFA based on number of instances of a symbol in a string
DFA based on number of instances of a symbol modulo n
DFA based on cartesian product
DFA based on Interpretation of a string as a binary number
DFA based on start symbol, end symbol and substring
Complementation
Advanced DFA's
Operations between languages