Regular Languages Flashcards
1
Q
When is a property decidable?
A
2
Q
Proof that it is decidable whether a regular language is empty.
A
3
Q
When is a word a member of a regular language? Give a proof why it is decidable.
A
4
Q
Proof that subsets of languages are decidable.
A
5
Q
Proof that equivalence of a language is decidable.
A
