A PDA for Palindromes of Even Length
Channel: Andreas Schaefer
Date: 2019-03-13

Palindromes are strings that read the same backward and forward. We construct a pushdown automaton that accepts the language of palindromes of even length. This construction requires us to guess the middle nondeterministically. It is known - not proven in the video - that PDAs cannot accept the language deterministically.