gs gs101 Finite Automata - Applications of NFA - 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 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: Under which of the following operation, NFA is not closed?
Union
Intersection
Concatenation
Kleene e) Negation.
Question 2: It is less complex to prove the closure properties over regular languages using:
NFA
DFA
PDA
Can’t be said
Question 3: Which of the following is an application of Finite Automaton?
Compiler Design
Grammar Parsers
Text Search
All of the mentioned
Question 5: Which of the following do we use to form an NFA from a regular expression?
Subset Construction Method
Power Set Construction Method
Thompson Construction Method
Scott Construction Method
Question 6: Which among the following can be an example of application of finite state machine(FSM)?
Communication Link
Adder
Stack
None of the mentioned
Question 7: Which among the following is not an application of FSM?
Lexical Analyser
BOT
State charts
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
