vu cs402 Final Term - Quiz No.11
vu cs402 Theory of Automata Quiz
This quiz belongs to book/course code vu cs402 Theory of Automata of vu organization. We have 36 quizzes available related to the book/course Theory of Automata. This quiz has a total of 10 multiple choice questions (MCQs) to prepare and belongs to topic Final Term. NVAEducation wants its users to help them learn in an easy way. For that purpose, you are free to prepare online MCQs and quizzes.
NVAEducation also facilitates users to contribute in online competitions with other students to make a challenging situation to learn in a creative way. You can create one to one, and group competition on an topic of a book/course code. Also on NVAEducation you can get certifications by passing the online quiz test.
Question 3: If we have two transition graphs then their union will be expressed by
taking a common start state and joining them by two null transitions
just connecting both start states by null transitions
connectting final state of first TG to the initial state of second TG
connecting the final state of first TG to the final state of second TG
Question 4: The states in which there is no way to leave after entry are called
Davey John Lockers
Dead States
Wast Baskets
all of the given
Question 6: In conversion form of PDA, no two __________ states exist in a row without __________ state.
POP, REJECT
PUSH, START
PUSH, READ
POP, READ
Question 7: Converting each of the final states of F to non-final states of F to final states, FA thus obtained will reject every string belonging to L and will accept every string, defined over, not belonging toL is called
transition graph of L
regular expression of L
complement of L
finite Automation of L
Question 10: Which of the following are called as Halt states in PDA?
Accept and Reject
Start and Accept
Read and Reject
Start and Reject
