Computer Science · Theory of Computation
एक संदर्भ-मुक्त व्याकरण (context-free grammar) G चॉम्स्की सामान्य रूप (Chomsky Normal Form) में होता है यदि प्रत्येक उत्पादन नियम इस रूप का हो:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1इनमें से कोई नहीं
- 2A → BCa या B → b
- 3A → BC या A → a✓
- 4A → BC या A → A
सही उत्तर देखें
A → BC या A → a
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!
Online Test Series
Preparing for Computer Science?
Practice full-length Computer Science mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Theory of Computation MCQs →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