gs gs101 Finite Automata - Basics - 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: Assume the R is a relation on a set A, aRb is partially ordered such that a and b are _____________
reflexive
transitive
symmetric
reflexive and transitive
Question 2: The non- Kleene Star operation accepts the following string of finite length over set A = {0,1} | where string s contains even number of 0 and 1
01,0011,010101
0011,11001100
ε,0011,11001100
ε,0011,11001100
Question 3: A regular language over an alphabet ∑ is one that cannot be obtained from the basic languages using the operation
Union
Concatenation
Kleene*
All of the mentioned
Question 4: Statement 1: A Finite automata can be represented graphically; Statement 2: The nodes can be its states; Statement 3: The edges or arcs can be used for transitions
Hint: Nodes and Edges are for trees and forests too.
Which of the following make the correct combination?
Hint: Nodes and Edges are for trees and forests too.
Which of the following make the correct combination?
Statement 1 is false but Statement 2 and 3 are correct
Statement 1 and 2 are correct while 3 is wrong
None of the mentioned statements are correct
All of the mentioned
Question 6: Which of the following is not a part of 5-tuple finite automata?
Input alphabet
Transition function
Initial State
Output Alphabet
Question 7: If an Infinite language is passed to Machine M, the subsidiary which gives a finite solution to the infinite input tape is ______________
Compiler
Interpreter
Loader and Linkers
None of the mentioned
Question 9: For the following change of state in FA, which of the following codes is an incorrect option?
δ (m, 1) = n
δ (0, n) = m
δ (m,0) = ε
s: accept = false; cin >> char; if char = "0" goto n;
Question 10: Given: ∑= {a, b}
L= {xϵ∑*|x is a string combination}
∑4 represents which among the following?
L= {xϵ∑*|x is a string combination}
∑4 represents which among the following?
{aa, ab, ba, bb}
{aaaa, abab, ε, abaa, aabb}
{aaa, aab, aba, bbb}
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
