Finite Automata Without Output
Introduction to Finite Automata
Deterministic Finite Automata (DFA)
Tuples
Q
Sigma
Sigma- Finite set of nonempty inputs denoted by a....z/0.....9
Delta
Q-0
Q-f
Non-Deterministic Finite Automata (NFA/NDFA)
Representation of Finite Automata
Conversion from NFA to DFA
String Acceptance by FA
Difference between NFA and DFA
Difference in Transition function
DFA transition function: Q x Sigma->Q
NFA transition Function: Q x Sigma->2^Q
In DFA no transition for empty input i.e for epsilon
In NFA transition for empty input i.e. for epsilon
DFA Designing
DFA for strings
Example: Asked in Previous year University Exam:
Construct a DFA machine over input alphabet Sigma= {0, 1}, that accepts odd number of 0's and even number of 1's
Subtopic
Example: Asked in Previous year University Exam:
Construct a DFA machine over input alphabet \sum_= {0, 1}, that accept even number of 1's
DFA for Languages
Example: Asked in Previous year University Exam:
Design a deterministic finite automata(DFA) for accepting the language L = {a^n b^{m} | m+n=even}
DDNRCSDD