Decidable Properties of Regular Languages
Channel: Andreas Schaefer
Date: 2019-03-15

Numerous problems are decidable for regular languages. For example, we can decide membership, i.e. if a word is in a regular language, or if two regular languages are equal.