Formal definition of a language accepted by PDA


I am a bit confused on how to give a formal definition of the language accepted by A? PDA

I can describe it by “The language of all strings starting with n-many a’s or n-many c’s followed by n-many b’s” and I have tried to give a formal definition by:

L(A) = {a^n c^n b^n | n ∈ N}

Is that the correct way to define it?