gs gs101 Regular Expressions and Languages - Conversion by Eliminating states - 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 Regular Expressions and 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 is an utility of state elimination phenomenon?
DFA to NFA
NFA to DFA
DFA to Regular Expression
All of the mentioned
Question 2: If we have more than one accepting states or an accepting state with an outdegree, which of the following actions will be taken?
addition of new state
removal of a state
make the newly added state as final
more than one option is correct
Question 3: Which of the following is not a step in elimination of states procedure?
Unifying all the final states into one using e-transitions
Unify single transitions to multi transitions that contains union of input
Remove states until there is only starting and accepting states
Get the resulting regular expression by direct calculation
Question 5: Which of the following methods is suitable for conversion of DFA to RE?
Brzozowski method
Arden’s method
Walter’s method
All of the mentioned
Question 7: The behaviour of NFA can be simulated using DFA.
always
never
sometimes
none of the mentioned
Question 8: It is suitable to use ____________ method/methods to convert a DFA to regular expression.
Transitive Closure properties
Brzozowski method
State elimination method
All 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
