| Type | Grammar Name | Automaton | Language Example | Recognition Power | |------|--------------|-----------|------------------|-------------------| | | Regular | Finite Automaton (DFA/NFA) | a*b* | Most restricted | | Type-2 | Context-Free | Pushdown Automaton (PDA) | a^n b^n | Balanced structures | | Type-1 | Context-Sensitive | Linear Bounded Automaton (LBA) | a^n b^n c^n | More complex | | Type-0 | Unrestricted | Turing Machine | Any computable language | Most powerful |
= Finite automaton + a stack. The stack provides memory for nested structures.
"Formal Languages and Automata Theory" by Dr. K. R. Puntambekar (published by Technical Publications) is a copyrighted textbook. Sharing or seeking unauthorized free PDF downloads violates copyright law and the publisher's rights. I cannot and will not provide links to pirated copies.
