The stack alphabet and input alphabet in a PDA must be identical.

In a pushdown automaton, the transition "a, a → a" (where the input is "a" and the top of stack is "a") results in no net change to the stack contents after execution.

A PDA transition can read an input symbol without changing the stack.

A PDA transition must always consume an input symbol.

A PDA can recognize all regular languages.

A PDA can have multiple start states.

L = {0ⁿ1ⁿ  : n>=0} is Context Free Langauge (True or False)

A pushdown automaton transition "a, ε → b" is valid and can be executed when the input symbol is 'a' and the stack is empty.

The language L = {aⁱ b^j | i ≠ j} can be recognized by a pushdown automaton.