Computer Science · Theory of Computation
k टेप वाले एक नियतात्मक बहु-टेप ट्यूरिंग मशीन (Deterministic multi-tape Turing machine) में संक्रमण फलन (transition function) 'δ' को किस प्रकार परिभाषित किया गया है?
- 1δ : Q × Γk × 2Q → Q × Γk × 2Q × {L, R, S}k
- 2δ : Q × Γk → Q × Γk × {L, R, S}k✓
- 3δ : Q × Q × Γk → Q × Q × Γk × {L, R, S}k
- 4δ : 2Q × Γk → 2Q × Γk × {L, R, S}k
सही उत्तर देखें
δ : Q × Γk → Q × Γk × {L, R, S}k
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