NTA-UGC-NET 2021 Dec & 2022 June Paper-1
October 13, 2023UGC NET CS 2007 June-Paper-2
October 13, 2023UGC NET CS 2007 June-Paper-2
| Question 1 |
The following deterministic finite automata recognizes :
| Set of all strings containing ‘ab’ | |
| Set of all strings containing ‘aab’ | |
| Set of all strings ending in ‘abab’ | |
| None of the above |
Question 1 Explanation:
There is no final state in the given deterministic finite automata so it can’t accept any string. Hence the answer is option(D)
Correct Answer: D
Question 1 Explanation:
There is no final state in the given deterministic finite automata so it can’t accept any string. Hence the answer is option(D)