true/false

a1 Uncountable infinity (for example, the cardinality of the real numbers) No Countable infinity (for example, the cardinality of the integers) ? All strings over the alphabet ? ?? ??? CFG Context-free Grammar CFL Context-free Language L(G) The language generated by a CFG G L(M) The language accepted by the automaton M. PDA Pushdown Automaton/Automata ISI The cardinality of set S. For example, lol = 0, and if s is an infinite set, ISI could be No or . 21. The future behavior of a PDA depends only on its current state and the input left to be read. 22. In the CF pumping theorem, vxy can occur anywhere in w. 23. When using the CF pumping theorem to show that a language L must show that for all possible pairs of values for v and y, and for E L. CFLs, you all qe o, uvexyez