gs gs101 Finite Automata - Epsilon Closures - 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 8 multiple choice questions (MCQs) to prepare and belongs to topic Finite Automata. 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 does not belong to input alphabet if S={a, b}* for any language?
a
b
e
none of the mentioned
Question 4: Design a NFA for the language:
L: {an| n is even or divisible by 3}
Which of the following methods can be used to simulate the same.
L: {an| n is even or divisible by 3}
Which of the following methods can be used to simulate the same.
e-NFA
Power Construction Method
e-NFA and Power Construction Method
None of the mentioned
Question 5: Which of the following belongs to the epsilon closure set of a?
{f1, f2, f3}
{a, f1, f2, f3}
{f1, f2}
none of the mentioned
Question 7: Which of the steps are non useful while eliminating the e-transitions for the given diagram?
Make a as accepting state of N’ if ECLOSE(p) contains an accepting state of N
Add an arc a to f1 labelled a if there is an arc labelled a in N from some state in ECLOSE(a) to f1
Delete all arcs labelled as e
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
