A. Interpreter
B. Loader and Linkers
C. Compiler
D. None of the Option is Correct
Tag: Formal Languages And Automation Theory MCQs
Transition function of DFA machine maps.
A. Q x Σ -> Q
B. Σ x Σ -> Q
C. Q x Q -> Σ
D. Σ x Q -> Σ
The minimum number of states required to recognize an octal number divisible by 3 are/is
The minimum number of states required to recognize an octal number divisible by 3 are/is
3
Well Done. According to the question, minimum of 3 states are required to recognize an octal number divisible by 3.
1
5
7
Let S and T be language over ={a,b} represented by the regular expressions (a+b*)* and (a+b)*, respectively. Which of the following is true?
Let S and T be language over ={a,b} represented by the regular expressions (a+b*)* and (a+b)*, respectively. Which of the following is true?
S=T
Well Done.
ScT (S is a subset of T)
TcS (T is a subset of S)
SnT=Ø
Assume the R is a relation on a set A, aRb is partially ordered such that a and b are _____________
Assume the R is a relation on a set A, aRb is partially ordered such that a and b are _____________
transitive and reflexive
Well Done. A partially ordered relation refers to one which is Reflexive, Transitive and Antisymmetric.
symmetric
reflexive
transitive
The following grammar G = (N, T, P, S) N = {S, A, B}
T = {a, b, c}
P : S ? aSa
S ? aAa
A ? bB
B ? bB
B ? c is
The following grammar G = (N, T, P, S) N = {S, A, B}
T = {a, b, c}
P : S ? aSa
S ? aAa
A ? bB
B ? bB
B ? c is
T = {a, b, c}
P : S ? aSa
S ? aAa
A ? bB
B ? bB
B ? c is
is type 2 but not type 3
Well Done.
is type 3
is type 1 but not type 2
is type 0 but not type 1
Which of the following is a not a part of 5-tuple finite automata?
Which of the following is a not a part of 5-tuple finite automata?
Output Alphabet
Well Done. A FA can be represented as FA= (Q, ∑, δ, q0, F) where Q=Finite Set of States, ∑=Finite Input Alphabet, δ=Transition Function, q0=Initial State, F=Final/Acceptance State).
Input alphabet
Transition function
Initial State
Let L denotes the language generated by the grammar S – OSO/00. Which of the following is true?
Let L denotes the language generated by the grammar S – OSO/00. Which of the following is true?
L is regular but not O
Well Done. Please note that grammar itself is not regular but language L is regular as L can be represented using a regular grammar, for example S -> S00/00.
L = O
L is context free but not regular
L is not context free
Given: ∑= {a, b}
L= {xϵ∑*|x is a string combination}
∑4 represents which among the following?
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?
{aaaa, abab, ε, abaa, aabb}
Well Done. ∑* represents any combination of the given set while ∑x represents the set of combinations with length x where x ϵ I.
{aa, ab, ba, bb}
{aaa, aab, aba, bbb}
All Options are Correct
Finite state machine is __________ tuple machine.
Finite state machine is __________ tuple machine.
5
Well Done. A finite-state machine is formally defined as a 5-tuple (Q, I, Z, ∂, W) such that: Q = finite set of states. I = finite set of input symbols.
6
4
unlimited