Computer Science · Theory of Computation
How many distinct Deterministic Finite Automata (DFAs) can be formed with 2 states (q0 and q1) over the input alphabet Σ = {0, 1, 2}, where q0 is always the designated initial state?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1512
- 2128
- 364
- 4256✓
Correct answer
256
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