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. Which of the following is true?
Q. Which symbol is used to separate more than one command in the same command line?
Q. Which of the printers used in conjunction with computers uses dry ink powder?
Q. What is testing of a complete bipartite subgraph in a bipartite graph problem called?
Q. Automatic repeat request error management mechanism is provided by ________
Q. The command to remove rows from a table ‘CUSTOMER’ is __________________
Q. The method of connecting a driving device to a loading device is known as
Discusssion
Login to discuss.