Computational Power of Nonuniform Finite Automata and Pushdown Automata Families with Multiple Counters

The use of multiple counters in nonuniform finite and pushdown automata families leads to the collapse of complexity classes, such as 2N and co-2N, as well as 2NPD and co-2NPD, when all valid instances are limited to polynomially long strings.