Consider the following finite automata F1 that accepts a language L

Let F2 be a finite automata which is obtained by reversal of F1. Then which of the following is correct? 

The correct answer is L(F1) = L(F2)

EXPLANATION:

Finite automata, also known as finite state machines, are abstract machines utilized in computer science and mathematical computations. They serve as a simple model for computation, providing a mathematical abstraction to describe and understand various systems' behaviors.

A finite automaton can be formally defined as a 5-tuple (Q, Σ, δ, q0, F) where:

• Q is a finite set of states.
• Σ (Sigma) is a finite set of symbols, called the alphabet of the automaton.
• δ (delta) is the transition function. It takes two arguments - a state and an input symbol, and returns the next state. δ : Q x Σ → Q
• q0 is the initial state from which any input is processed (q0 ∈ Q).
• F is a set of final state/states of Q (F ⊆ Q).

F1:

F2:  Reversal of F1

Both are accept same string so L(F1) = L(F2)