Computer Science · Theory of Computation
एक पुशडाउन ऑटोमेटा (PDA) में, ट्रांजिशन फंक्शन δ को औपचारिक रूप से किस रूप में परिभाषित किया जाता है?
- 1Q × Σ → P(Q × Γ)
- 2Q × (Σ ∪ {λ}) × Γ → P(Q × Γ)✓
- 3Q × Σ → Q
- 4Q × Σ × Γ → Q
सही उत्तर देखें
Q × (Σ ∪ {λ}) × Γ → P(Q × Γ)
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Want more practice questions on Theory of Computation?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Theory of Computation