CFG equivalent to PDA in hindi | context free grammar equivalent to push down automata in hindi | toc tutorial in hindi | theory of computation in hindi
Computer Science Engineering Tutorials in Hindi | Theory of ComputationCFG equivalent to PDA in hindi | Cntext free grammar equivalent to push down automata in hindi | TPC tutorial in hindi | Theory of computation in Hindi
R.H.S पर पहला symbol। production एक terminal symbol होना चाहिए। CFG से PDA प्राप्त करने के लिए following steps का उपयोग किया जाता है:
Step 1 : CFG के दिए गए productions को GNF में Convert करेंगे ।
Step 2 : PDA में Only एक state {q} होगी।
Step 3 : CFG का initial symbol PDA में initial symbol होगा।
Step 4 : Non-terminal symbol के लिए, following rule जोड़ें:
δ(q, ε, A) = (q, α)
जहाँ production rule A → α है
Step 5: each terminal symbols के लिए, following rule जोड़ें:
δ(q, a, a) = (q, ε) for every terminal symbol
