Regular Languages

Question 1

When is a property decidable?

Answer 1

Question 2

Proof that it is decidable whether a regular language is empty.

Answer 2

Question 3

When is a word a member of a regular language? Give a proof why it is decidable.

Answer 3

Question 4

Proof that subsets of languages are decidable.

Answer 4

Question 5

Proof that equivalence of a language is decidable.

Answer 5