## Discussion Forum

Que. | The minimum number of states of the non-deterministic finite automation which accepts the language
{a b a bn| n ≥ 0} ∪ {a b an|n ≥ 0} is |

a. | 3 |

b. | 4 |

c. | 5 |

d. | 6 |

Answer:5 |

Que. | The minimum number of states of the non-deterministic finite automation which accepts the language
{a b a bn| n ≥ 0} ∪ {a b an|n ≥ 0} is |

a. | 3 |

b. | 4 |

c. | 5 |

d. | 6 |

Answer:5 |

Questions from Previous year GATE question papers

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.