The latest articles on DEV Community by Muhammad Sajjad Saddique (@muhammad_sajjad). https://dev.to/muhammad_sajjad https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https:%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F769120%2F7ac0979a-e708-40d5-ab16-9a8302fdfbdb.jpg https://dev.to/muhammad_sajjad en Muhammad Sajjad Saddique Wed, 08 Dec 2021 05:56:47 +0000 https://dev.to/muhammad_sajjad/pda-pushdown-automata-1m94 https://dev.to/muhammad_sajjad/pda-pushdown-automata-1m94 <p>Pushdown automata is a finite automata with extra memory called stack which helps pushdown automata to recognize Context Free Languages.</p> <p>A pushdown autimaton is a way to implement a context-free grammar in a similar way we design DFA for a regular grammar. A DFA can remember a finite amount of information, but a PDA can remember an infinite amount of information.<br> Basically a pushdown autimaton is-<br> "Finite state machine" + "a stack"<br> A pushdown autimaton has three components-</p> <ul> <li><p>an input tape,</p></li> <li><p>a control unit, and </p></li> <li><p>a stack with infinite size.</p></li> </ul> <p>A pushdown automata (PDA) can be defined as:</p> <p>Q:is a set of states<br> q0:is the initial state<br> Z: is the initial pushdown symbol<br> F: is the set of final states etc.</p> pushdownautomata