Correction to Slide 14 of Lecture 9 (Deadlock-free CFMs)

The definition of deadlock-free CFM on slide 14 of Lecture 9 has a flaw. Instead, you should use the definition on slide 29 of Lecture 8, which is correct.

Intuitively, a CFM has a deadlock if it has a run on some input word w reaching a configuration from which a final (accepting) configuration cannot be reached. A CFM is deadlock-free, if it contains no deadlock.