## Discussion Forum

Que. | The smallest finite automation which accepts the language {x | length of x is divisible by 3} has : |

a. | 2 states |

b. | 3 states |

c. | 4 states |

d. | 5 states |

Answer:3 states |

Que. | The smallest finite automation which accepts the language {x | length of x is divisible by 3} has : |

a. | 2 states |

b. | 3 states |

c. | 4 states |

d. | 5 states |

Answer:3 states |

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.