Time Left - 15:00 mins
GATE CS 2021 : Theory of computation Rapid Quiz 1
Attempt now to get your rank among 815 students!
Question 1
Number of final states in DFA over Ʃ = {0, 1} with each string contains Either odd number of 0’s or even number of 1’s but not the both together
Question 2
Which of following is considered as final states in DFA over Ʃ = {0, 1} with each string contains even number of 0’s and even number of 1’s.
Question 3
Assume ∑ = {a} and ε is the empty string.
What is the language accepted by the NFA?
Question 4
. Assume ∑ = {a} and ε is the empty string.
What is the complement of the language accepted by the NFA shown below?
Question 5
Which of the following CFG generates a language where the language is CFL but not regular.
Question 6
There exist an equivalent _____ for every pushdown automata?
- 815 attempts
- 1 upvote
- 9 comments
Dec 12GATE & PSU CS