GkSeries.com

Automata Theory Quiz | Automata Theory Objective Type Questions and Answers

Download PDF

Free download in PDF Automata Theory Objective Type Questions and Answers for competitive exams. These short objective type questions with answers are very important for Board exams as well as competitive exams. These short solved questions or quizzes are provided by Gkseries.
Go To Download Page
(21) "CFG" stands for _________
[A] Context Free Grammar
[B] Context Free Graph
[C] Context Finite Graph
[D] Context Finite Grammar
Answer: Context Free Grammar
(22) ------------------- is obviously infinite language.
[A] EQUAL-EQUAL
[B] EVEN-EVEN
[C] PALINDROME
[D] FACTORIAL
Answer: PALINDROME

DOWNLOAD CURRENT AFFAIRS PDF FROM APP

(23) The languages -------------- are the examples of non regular languages.
[A] PALINDROME and EVEN-EVEN
[B] EVEN-EVEN and PRIME
[C] FACTORIAL and SQURE
[D] PALINDROME and PRIME
Answer: PALINDROME and PRIME
(24) The language generated by that CFG is regular if _________
[A] No terminal → word
[B] No terminal → semi word
[C] Both a and b
[D] None of given
Answer: Both a and b
(25) If a TG has more than one start states, then
[A] Replace the old final state with new start state
[B] Eliminate the old start state
[C] Introduce the new start state
[D] Replace the old start state with final state
Answer: Introduce the new start state
(26) A language accepted by an FA is also accepted by Select correct option:
[A] GTG only
[B] TG only
[C] RE only
[D] All of the given
Answer: All of the given

Please share this page

Click Here to Read more questions

Teacher Eligibility Test