Question 14117 – NIC-NIELIT STA 2020
November 30, 2023Routing
November 30, 2023NTA UGC NET JUNE-2023 Paper-2
| Question 21 |
Consider the following finite automata F1 that accepts a language L
Let F2 be a finite automata which is obtained by reversal of F1.ten which of the following is correct?
| L(F1) ≠ L(F2) | |
| L(F1)=L(F2)
| |
| L(F1) ≤ L(F2)
| |
| L(F1) ≥ L(F2) |
Question 21 Explanation:
When a finite automaton F1 is reversed to obtain F2, the language accepted by F2 is the reverse of the language accepted by F1. In other words, if F1 accepts language L, then F2 accepts the language L reversed (the reverse of all strings in L)
Correct Answer: B
Question 21 Explanation:
When a finite automaton F1 is reversed to obtain F2, the language accepted by F2 is the reverse of the language accepted by F1. In other words, if F1 accepts language L, then F2 accepts the language L reversed (the reverse of all strings in L)
Subscribe
Login
0 Comments