Home / Engineering / Theory of Computation / Question
M
Q.) Consider the regular language L =(111+11111)*. The minimum number of states in any DFA accepting this languages is:
Related MCQs on Theory of Computation
Q. Which of the following time stamps need not exist for a file on traditional unix file system
Q. Which one of the following uniquely identiļ¬es the elements in the relation?
Q. Public key cryptography also called as________
Q. Which of the following is Backup software?
Q. TCP/IP port number 443 is assigned for .
Q. ---------------It shows the flow of material ,energy and information that hold system together.
Discusssion
Login to discuss.