Home / Engineering / Theory of Computation / Question
M
Q.) A minimum state deterministic finite automation accepting the language L = {W W € {0,1}* , number of 0's and 1's in W are divisible by 3 and 5 respectively has
Related MCQs on Theory of Computation
Q. Int Main() { Int A = 10.5; Printf("%D",A); Return 0; }
Q. In an object of type Thread in the namespace System.Threading represents and controls one thread.
Q. can be defined as the manipulation,
Q. Body of individual should consist of :
Q. Who access the database occasionally and have different needs each time:
Q. The situation wherein the data of operands are not available is called
Q. Testing Process comprised of
Q. In a the system makes repeated requests for tuples from the operation at the top of the pipeline.
Discusssion
Login to discuss.