Decision properties of finite automata

Question

Is equivalence problem decidable problem or not?

Comments

yes,equivalence problem for finite automata is decidable,languages generated by finite automata ,we can say equivalent or not.

---

Thanks

---

@Prateek

Is these are recursive? then how?

---

Decision properties of finite automata on equivalence

talking about finite automata which is decidable ,i can draw DFA for languages and i can easily say that languages are equivalent or not, right.

for recursive language ,there exist  TM , but i can't say that languages are equivalent or not ,equivalance problem for recursive are undecidable.

Answer 1

Decidable as the minimal dfa is constructible in polynomial time