Computer Science · Theory of Computation
Let F1 be a Finite Automaton that accepts a regular language L. Let F2 be a Finite Automaton obtained by reversing all the transitions, interchanging the initial and final states of F1. Then which of the following is correct regarding the language accepted by F2?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1L(F2) ⊆ L
- 2L(F2) = L
- 3L(F2) = LR✓
- 4L(F2) ≠ LR
Correct answer
L(F2) = LR
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