Time Left - 12:00 mins
GATE CS 2019 - Theory Of Computation( RE & FA ) Quiz -1 (App update required to attempt this test)
Attempt now to get your rank among 463 students!
Question 1
Consider the following NFA :
The number of states and the number of final states in the DFA respectively are?
The number of states and the number of final states in the DFA respectively are?
Question 2
Which of the following is true regarding the arden theorem?
Question 3
The number of states in the minimal deterministic finite automaton corresponding to the regular expression (0 + 1)∗(10) is__________.
Question 4
Consider the following regular expression
R = b*a+ b(a + b)*
Let L(R) be the language generated by R. Then L(R) can also be generated from which of the following regular expression.
R = b*a+ b(a + b)*
Let L(R) be the language generated by R. Then L(R) can also be generated from which of the following regular expression.
Question 5
Consider the following NFA that accept a regular language L over
Find the number of states in the minimized DFA that accepts a complement of language L.
Find the number of states in the minimized DFA that accepts a complement of language L.
Question 6
Which of the following are extended transition functions of a DFA and NFA respectively?
- 463 attempts
- 1 upvote
- 2 comments
Aug 12GATE & PSU CS