Editing Automata Theory (section)

== <span style="color: #FFFFFF;">Understanding</span> ==
Automata theory is understood through '''States''' and '''Memory'''.

'''1. The "States of Being" (FSM)''':
Most machines are simple.
* A **Turnstile** has two states: **LOCKED** and **UNLOCKED**.
* If you "Push" while Locked → Stay Locked.
* If you "Insert Coin" while Locked → Go to Unlocked.
* If you "Push" while Unlocked → Go to Locked.
* Automata theory is the art of "Drawing the Map" of these states to ensure the machine "Never gets lost."

'''2. The "Stack" (Pushdown Automata)''':
Memory changes the power of a machine.
* A simple FSM can count "1, 2, 3..." but it cannot "Remember" how many **(A)**s it saw to match them with **(B)**s (e.g., the language AABB).
* A **Pushdown Automaton** uses a "Stack" (like a 'Pile of Plates') to "Save" symbols and "Pop" them later.
* This is how "Programming Languages" check if your "Brackets" are balanced: { { ( ) } }.

'''3. The "Infinite Tape" (Turing Machine)''':
The "Limit of Computation."
* Alan Turing proved that if you have a "State Machine" and a "Paper Tape" that never ends, you can "Calculate anything that is calculable."
* This means your "iPhone" is not "More Powerful" than a Turing Machine from 1936; it is just "Faster." Both can solve the **same set of problems**.

'''The 'Halting Problem''''': Turing's greatest proof. He showed that you "Cannot write an Automaton" that can look at another Automaton and "Predict" if it will "Run forever" or "Stop." This proved that "Logic" has "Dead Ends" where even a "God-like computer" could not find an answer.
</div>

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