Creating a Deterministic Pushdown Automata (pda) that decides L = {a^(m)b^(n)c^(p) | n does not equal p}. FSM, code in Racket Language
When aiming to create a deterministic PDA for the given language, L = {a^(m)b^(n)c^(p) | n does not equal p}, I had come up with the following pda, along with tests that should in theory work: