Formal Languages And Automata Theory By Puntambekar Pdf _best_ Free Download Now

| 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 |

:

Example: ( S \rightarrow aSb \mid \varepsilon ) generates ( a^n b^n ), which is not regular. | Type | Grammar Name | Automaton |