## Discussion Forum

Que. | What can be said about a regular language L over {a} whose minimal finite state automaton has two states? |

a. | L must be {a^n| n is odd} |

b. | L must be {a^n| n is even} |

c. | L must be {a^n| ³ O} |

d. | Either L must be {a^n | n is odd}, or L must be {a^n | n is even} |

Answer:Either L must be {a^n | n is odd}, or L must be {a^n | n is even} |