gs gs101 Push Down Automata - PDA-Acceptance by Empty Stack - 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 Push Down 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: If two sets, R and T has no elements in common i.e. RÇT=Æ, then the sets are called
Complement
Union
Disjoint
Connected
Question 2: Which among the following is not a part of the Context free grammar tuple?
End symbol
Start symbol
Variable
Production
Question 3: A context free grammar is a ___________
A rule system for parsing formal languages
Regular grammar
Context sensitive grammar
None of the mentioned
Question 4: The closure property of context free grammar includes :
Kleene
Concatenation
Union
All of the mentioned
Question 5: Which of the following automata takes stack as auxiliary storage?
Finite automata
Push down automata
Turing machine
All of the mentioned
Question 6: Which of the following automata takes queue as an auxiliary storage?
Finite automata
Push down automata
Turing machine
All of the mentioned
Question 7: A context free grammar can be recognized by
Push down automata
2 way linearly bounded automata
Push down automata & 2 way linearly bounded automata
None of the mentioned
Question 8: A null production can be referred to as:
String
Symbol
Word
All of the mentioned
Question 9: The context free grammar which generates a Regular Language is termed as:
Context Regular Grammar
Regular Grammar
Context Sensitive Grammar
None of the mentioned
Question 10: NPDA stands for
Non-Deterministic Push Down Automata
Null-Push Down Automata
Nested Push Down Automata
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
