vu cs402 Final Term - Quiz No.15
vu cs402 Theory of Automata Quiz
This quiz belongs to book/course code vu cs402 Theory of Automata of vu organization. We have 36 quizzes available related to the book/course Theory of Automata. This quiz has a total of 10 multiple choice questions (MCQs) to prepare and belongs to topic Final Term. 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: S-aXbIbXa
X-aXIbXIA
the given CFG generates the language in english __________
X-aXIbXIA
the given CFG generates the language in english __________
beginning and ending in different letters
begning and ending in same letter
having even-even language
none of given
Question 2: Which of the following statement(s) is/are true or false?
(1)The Turing Machine is similar to a finite automation but with an unlimited and unrestricted memory.
(2) A Turing machine much more accurate model of a general purpose computer.
(1)The Turing Machine is similar to a finite automation but with an unlimited and unrestricted memory.
(2) A Turing machine much more accurate model of a general purpose computer.
Statement 1 is true
Statement 2 is true
Both statements (1 & 2) are false
Both are true
Question 3: An alphabet of Σ is valid if
no letter of Σ appears in midle of any other letter
no letter of Σ appears at end of any other letter
no letter ofΣ appears at start of any ather letter
no letter of Σ appears at end or middle of any other letter
Question 4: Consider the followin CFG: S- Xa X- aX |bX|^ above given CFG can be represented by RE __________
a*b*
a*b*a
(a+b)*a
a(a+b)*a
Question 6: Does the empty string match the regular expression y+a ?
Yes
No
TRUE
FALSE
Question 7: The strings or words which do not belong to a language is called __________ of that language
Intersection
Union
Complement
Quotient
Question 10: Proof if a TG has more than one star states then
introduce the new start state
eliminate the old start state
replace the old start state with final state
replace the old final state with new start state
