Home / Engineering / Theory of Computation / Question
M
Q.) The following grammar
G = (N, T, P, S)
N = {S, A, B, C}
T = {a, b, c}
P : S → aS
A → bB
B → cC
C → a is
Related MCQs on Theory of Computation
Q. The File Transfer Protocol is built on ______________
Q. feature allows you to optimize your system and capture all possible transactions.
Q. Which type of coupling involves direct reference to attributes or methods of another object?
Q. The normalized representation of 0.0010110 * 2 9 is
Q. Conventional cryptography is also known as or symmetric-key encryption.
Q. a code known as grid which runs on GPU consisting of a set of
Q. The union of two equivalence relations on a non- empty set is an equivalence relation.
Q. The document listing all procedure and regulations that generally govern an organization is the
Discusssion
Login to discuss.