Computer Science · Theory of Computation
दो परिमित ऑटोमेटा (finite automata) को समतुल्य माना जाता है यदि:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1उनमें स्थितियों की संख्या समान हो और उनका वर्ण सेट समान हो।
- 2उनका स्ट्रिंग पहचान व्यवहार (स्वीकृत भाषा) समान हो।✓
- 3उनमें स्थितियों (states) की संख्या समान हो।
- 4उनका वर्ण सेट समान हो।
सही उत्तर देखें
उनका स्ट्रिंग पहचान व्यवहार (स्वीकृत भाषा) समान हो।
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
Start Free Mock Test →Preparing for Computer Science?
Practice full-length 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