Theory of Automata Notes

Theory of Automata Complete Notes

Introduction

Theory of Automata computer science ka branch hai jo machines aur languages ko study karta hai.
Iska use compiler design, AI aur text processing mein hota hai.

Finite State Machine

FSM ek mathematical model hai jo limited states use karta hai.
Example: vending machine, traffic light system.

Regular Expressions

Pattern define karne ke liye use hota hai.
Example: (a+b)* means all possible strings of a and b.

Finite Automata

DFA aur NFA machines hain jo strings accept/reject karti hain.
DFA = single path, NFA = multiple paths.

Pumping Lemma

Is se prove hota hai ke koi language regular nahi hai.
Example: 0ⁿ1ⁿ language not regular.

CFG & PDA

CFG rules define karta hai language structure ko.
PDA stack use karta hai nested languages ke liye.

Turing Machine

Most powerful theoretical machine hai.
Infinite tape use karta hai computation ke liye.