Skip to main content

Implementing Packet Sequence Validation using Pushdown Automata

In the previous blog post I discussed how a formal grammar can be transformed into a pushdown automaton in order to check if a sequence of packets or tokens is part of the language described by the grammar. In this post I will discuss how I implemented said automaton in Java in order to validate OpenPGP messages in PGPainless.

#automaton #java #openpgp #pgpainless #pushdown
Your PDA diagram looks a bit fishy. And by "fishy", I mean it looks like a fish. ;)
On a more serious note, a long time ago, I used to teach finite automata, so it's always fun to see people using it in real life.