## Discussion Forum

Que. | Let w be any string of length n is {0,1}*. Let L be the set of all substrings of w. What is the minimum number of states in a non-deterministic finite automaton that accepts L? |

a. | n-1 |

b. | n |

c. | n+1 |

d. | 2n-1 |

Answer:n+1 |

Que. | Let w be any string of length n is {0,1}*. Let L be the set of all substrings of w. What is the minimum number of states in a non-deterministic finite automaton that accepts L? |

a. | n-1 |

b. | n |

c. | n+1 |

d. | 2n-1 |

Answer:n+1 |

Questions from Previous year GATE question papers

UGC NET Previous year questions and practice sets

UGC NET Previous year questions and practice sets

Attempt a small test to analyze your preparation level. This GATE exam includes questions from previous year GATE papers.

Practice test for UGC NET Computer Science Paper. The questions asked in this NET practice paper are from various previous year papers.