gs gs101 Finite Automata - DFA Processing Strings - 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 9 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: The password to the admins account=”administrator”. The total number of states required to make a password-pass system using DFA would be __________
14 states
13 states
12 states
A password pass system cannot be created using DFA
Question 2: Which of the following is the corresponding Language to the given DFA?
L = {x ϵ {0, 1} * | x ends in 1 and does not contain substring 01}
L = {x ϵ {0,1} * |x ends in 1 and does not contain substring 00}
L = {x ϵ {0,1} |x ends in 1 and does not contain substring 00}
L = {x ϵ {0,1} * |x ends in 1 and does not contain substring 11}
Question 3: Let ∑= {a, b, …. z} and A = {Hello, World}, B= {Input, Output}, then (A*∩B) U (B*∩A) can be represented as:
{Hello, World, Input, Output, ε}
{Hello, World, ε}
{Input, Output, ε}
{}
Question 6: For the DFA given below compute the following:
Union of all possible combinations at state 7,8 and 9.
Union of all possible combinations at state 7,8 and 9.
{aba, ac, cc, ca, cb, bc, bab, ca}
{bab, bc, ac, aba, ca, aac, ccb}
{cc, ca, cb, aba, bab, ac}
{aba, ac, cc, ca, cb, bc, bab, caa}
Question 7: Given L= {Xϵ∑*= {a, b} |x has equal number of a, s and b’s}.
Which of the following property satisfy the regularity of the given language?
Which of the following property satisfy the regularity of the given language?
Regularity is dependent upon the length of the string
Regularity is not dependent upon the length of the string
Can’t be said for a particular string of a language
It may depend on the length of the string
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
