And here are the transcripts: https://archive.computerhistory.org/resources/access/text/20... (Part 1, 2016-08-12) and https://archive.computerhistory.org/resources/access/text/20... (Part 2, 2016-11-11)
(All four available from https://www.computerhistory.org/collections/oralhistories/?s...)
The papers by Dijkstra and Knuth that you mention are I think:
• (1965 Dijkstra) "Solution of a problem in concurrent programming control" (in CACM)
• (1966 Knuth) "Additional comments on a problem in concurrent programming control" (Letter to CACM, reprinted with an addendum as Chapter 13 of his Selected Papers on Design of Algorithms)
[From the addendum and comments on the latter, I don't get the impression that it had an error (and I don't get that impression from Lamport's comments in the transcripts either). He cites Gary L. Peterson's "Myths About the Mutual Exclusion Problem" (1981, https://zoo.cs.yale.edu/classes/cs323/doc/Peterson.pdf) as a later improvement though. But I may have misunderstood, as I have not read any of these papers/letters or even understood the question :)]
I will confess that I do not have the book with me, so it may actually be a different algorithm in that text. I can not remember. :( Going off of here[2], the algorithm I am referring to is chapter 9, "Fast pattern matching in strings."
[1] www.amazon.com/Selected-Papers-Algorithms-Language-Information/dp/1575865823/