Skip to main content

Posts

Showing posts from August, 2020

DFA | Deterministic Finite Automata

Automata Theory for begginers | Regular Expression

Basics of Automata Theory

LEARNING OUTCOMES- STUDENT(S) WILL ABLE TO EXPLAIN- LO-1: Symbols, Alphabets & String and  Kleene Star (*/+). LO-2: Language & Regular Expression. LO-3: Transition Function, State   Diagram & Transition Matrix. LO-4: Grammar and conversion from   State Diagram to Grammar. v Automata is an ABSTRACT M/C. v DEALS WITH THE LOGIC OF COMPUTATION WITH RESPECT TO SIMPLE M/C. v AUTOMATA ENABLES COMPUTER SCIENTISTS AND ENGINEERS TO UNDERSTAND HOW  M/C  COMPUTE THE FUNCTION AND SOLVE PROBLEMS . SYMBOLS : a, b,------, z, .....    0, 1,------ ALPHABETS : (Ʃ)   < SET OF SYMBOLS> i ) Ʃ = { a, b }     ii) Ʃ = {a, b, 0, 1} STRING: { ϵ , a, b, ab },  ϵ : Epsilon   “LENGTH OF STRINGS”:  | ^ | = 0, |a| = 1, | ab | = 2                                         ...