Computer Science · Theory of Computation
Consider a Deterministic Finite Automata (DFA) that processes strings over the alphabet Σ = {a, b, c}. If the DFA accepts a language L, which of the following provides the most accurate formal description of L if it accepts strings containing an even number of occurrences of the substring 'abc'?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1L = {Set of strings having an even count, including zero, of the substring 'abc'}✓
- 2L = {Set of strings starting with 'a', 'b', or 'c' and ending with 'c'}
- 3L = (a + b + c)(abc)(a + b + c)
- 4L = (a* + b* + c*)
Correct answer
L = {Set of strings having an even count, including zero, of the substring 'abc'}
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