Computer Science · Theory of Computation
Consider the statements explaining why non-trivial palindromes cannot be recognized by Finite State Automata (FSA): S1: FSA cannot deterministically fix the midpoint. S2: Even if the midpoint is known, FSA cannot match the second half with the first half because it lacks memory. S3: FSA cannot have arbitrarily large memory. Which combination of statements correctly and sufficiently explains this limitation?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1S1, S2, and S3 are all required
- 2S1 and S3 are sufficient
- 3S2 and S3 are sufficient✓
- 4Only S1 is sufficient
Correct answer
S2 and S3 are sufficient
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