Editing Automata Theory (section)

== <span style="color: #FFFFFF;">Remembering</span> ==
* '''Automata''' (singular: Automaton) — An abstract mathematical "Machine" that "Changes state" based on "Input."
* '''Finite State Machine (FSM)''' — The simplest automaton: a machine with a "Fixed number" of states (e.g., 'ON' or 'OFF').
* '''Deterministic Finite Automaton (DFA)''' — An FSM where every "Input" leads to exactly "One" next state (Predictable).
* '''Non-deterministic Finite Automaton (NFA)''' — An FSM where one input can lead to "Multiple" possible next states (Can explore many paths at once).
* '''Pushdown Automaton (PDA)''' — An FSM with a "Memory" (a Stack); used for processing "Parentheses" and "Nested Logic."
* '''Turing Machine (TM)''' — The most powerful automaton: an FSM with an "Infinite Tape" for memory. It can "Simulate any computer algorithm."
* '''State''' — The "Current Condition" of a machine (e.g., 'Waiting for Payment,' 'Dispensing Soda').
* '''Alphabet (Sigma)''' — The set of "Symbols" the machine can read (e.g., {0, 1}).
* '''Transition Function''' — The "Rules" of the machine (e.g., 'If in state A and see 1, go to state B').
* '''Halting''' — When a machine "Stops" because it has finished its work or reached an "Accept" state.
* '''The Chomsky Hierarchy''' — The "Ladder" of machines and the "Languages" they can understand (Regular, Context-Free, Context-Sensitive, Recursively Enumerable).
</div>

<div style="background-color: #006400; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">