+1-315-636-4485
+91 98151-74050 
This quiz contains MCQs on finite automata, Moore and Mealy machines, processing strings, transition functions, epsilon transitions, uses and closures, and DFA and NFA's applications and language.
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
The non-Kleene Star operation accepts the following string of finite length over set A = {0,1}, where string s contains even numbers of 0 and 1
01,0011,010101
0011,11001100
ε,0011,11001100
ε,0011,11001100
A regular language over an alphabet ∑ cannot be obtained from the basic languages using the operation
Union
Concatenation
Kleene*
All of the above
The minimum number of states required to recognize an octal number divisible by three is
1
3
5
7
Which of the following is not a part of 5-tuple finite automata?
Input alphabet
Transition function
Initial state
Output alphabet
Which among the following is represented by ∑= {a, b}L= {xϵ∑*|x is a string combination}∑4?
{aa, ab, ba, bb}
{aaaa, abab, ε, abaa, aabb}
{aaa, aab, aba, bbb}
All of the above
Which of the following codes is an incorrect option for the following change of state in FA?
δ (m, 1) = n
δ (0, n) = m
δ (m,0) = ε
The number of elements in the set for the language L={xϵ(∑r) *|length if x is at most 2} and ∑={0,1} is
7
6
8
5
What does the O/P of a Mealy machine depend on?
State
Previous state
State and iput
Only input
Which of the following formats can accurately represent the O/P of a Mealy machine?
Op(t)= δ(Op(t))
Op(t)= δ(Op(t)i(t))
Op(t): ∑
None of the above
The Mealy and Moore machines are classified as
Inducers
Transducers
Turing machines
Linearly bounder automata
The significant difference between the Mealy and Moore machines is their
Output variations
Input variations
All of the above
None of the above
A Mealy machine
Produces a language
Produces grammar
Can be converted to NFA
Has less circuit delays
Statement 1: Mealy machine reacts faster to inputs.
Statement 2: Moore machine has more circuit delays.
Choose the correct option out of the following:
Both statements are true
Statement 1 is true but statement 2 is false
Statement 1 is false and statement 2 is true
Both statements are false
Statement 1: A finite automata can be represented graphically
Statement 2: The nodes can be their 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?
Statement 1 is false but statements 2 and 3 are true
Statements 1 and 2 are true while statement 3 is false
Both statements are true
Both statements are false
