Recent posts tagged gate-result

Show that in a group of five people (where any two people are either friends or enemies), there are not necessarily three mutual friends or three mutual enemies.

For empty string as language, q0 as final states gives 16 DFAs. But when both q0 and q1 are final states we must ensure none of the transitions go to q1 from q0. This red...

I doubt the correctness of this solution, the diagram below; in Red Rectangle shows what this solution is suggesting, on the other hand the image in the Green Rectangle s...

Answer: A and C.For every NFA there exists a DFA.For every NPDA there does not exist a deterministic PDA.Every nondeterministic Turing machine has an equivalent determini...

Answer: A

Answer: (B)$\textsf{Bind:}$ Binds the socket to an address$\textsf{Listen:}$ Waits for connections to the socket$\textsf{Accept:}$ Accepts a connection to the socket $\te...

To count the no soultions , we need to select 17 items with x1,x2 and x3. So No of sol is equal to 17 combinations of x1,x2 and x3 elements.c(3+17-1,17)=c(19,17)=171.