...
NTA-UGC-NET 2021 Dec & 2022 June Paper-1
October 13, 2023
UGC NET CS 2007 June-Paper-2
October 13, 2023
NTA-UGC-NET 2021 Dec & 2022 June Paper-1
October 13, 2023
UGC NET CS 2007 June-Paper-2
October 13, 2023

UGC NET CS 2007 June-Paper-2

Question 1
The following deterministic finite automata recognizes :
A
Set of all strings containing ‘ab’
B
Set of all strings containing ‘aab’
C
Set of all strings ending in ‘abab’
D
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)

Leave a Reply

Your email address will not be published. Required fields are marked *