Properties of Regular Languages Chapter 4. Regular Languages A language is regular iff it is accepted by some DFA. Example: L = {w { a, b }* : every.
