Home / Engineering / Theory of Computation / Question
M
Q.) Languages are proved to be regular or non regular using pumping lemma.
Related MCQs on Theory of Computation
Q. The main contents of the routing table in datagram networks are ___________
Q. user on unix system is alled as
Q. --------------indicates the exact manner in which the integrated serious of activities will
Q. Which of the following can be an Ethernet physical address?
Q. Relations produced from an E-R model will always be in:
Q. Which of the following statements is true about stress management?
Discusssion
Login to discuss.