gs gs101 Properties of Regular Languages - Conversions among Representations - Quiz No.1
gs gs101 Automata Theory Quiz
This quiz belongs to book/course code gs gs101 Automata Theory of gs organization. We have 92 quizzes available related to the book/course Automata Theory. This quiz has a total of 10 multiple choice questions (MCQs) to prepare and belongs to topic Properties of Regular Languages. 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 1: Which of the following conversion is not feasible?
Regular expression to automaton conversion
Automaton to Regular Expression Conversion
NFA to DFA
None of the mentioned
Question 2: The computation of e-closure of n-states takes ______ time.
O(n2)
O(n3)
O(2n)
None of the mentioned
Question 5: Conversion of regular expression to e-NFA takes ___________ time.
linear
exponential
logarithmic
none of the mentioned
Question 6: The conversion of NFA to DFA can be done in:
exponential time
linear time
logarithmic time
all of the mentioned
Question 7: Which of the following cannot be converted in an ordinary NFA?
DFA
Regular Expression
e-NFA
None of the mentioned
Question 8: NFA to DFA conversion is done via
Subset Construction method
Warshalls Algorithm
Ardens theorem
None of the mentioned
Online Quizzes of gs101 Automata Theory
Other Classes Of Problems - Randomized Algorithm - Quiz No.1
gs gs101
Automata Theory Online Quizzes
Push Down Automata - DPDA and Ambiguous Grammars - Quiz No.1
gs gs101
Automata Theory Online Quizzes
