Computer Science · Theory of Computation
Determine the language accepted by a deterministic finite automaton over Σ = {a, b} that accepts strings starting with the sequence 'ab':
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1The set of all strings on Σ = {a, b} containing no 'b'
- 2The set of all strings on Σ = {a, b} starting with 'a' or 'b'
- 3The set of all strings on Σ = {a, b} ending with prefix 'ab'
- 4The set of all strings on Σ = {a, b} starting with prefix 'ab'✓
Correct answer
The set of all strings on Σ = {a, b} starting with prefix 'ab'
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