Two-Stack Pushdown Automaton for Recognizing a^n b^n c^n

An exploration of a two-stack PDA designed to recognize strings of the form a^n b^n c^n within the theory of computation, focusing on the flat automaton model.