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?
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: B. L(F1) = L(F2)
Explanation
Reversing an automaton (swap start and final states, reverse every edge) accepts the reverse of L. The figure's edge labels are not legible in the source; the official key takes the language as unchanged by reversal (L(F1) = L(F2)).
More Theory of Computation and Compilers questions
- Which phase of compiler checks the grammar of programming?
- A. The set of turning machine codes for TM's that accept all inputs that are palindromes (possible along with some other inputs) is decidab…
- Which of the following parser is most powerful parser?
- Which of the following statement is correct?
- The compiler for high level language that runs on one machine and produces code for other machine is called-
- In the context of Binding which one of the following is incorrect?