21 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, 101 o, and if S is an infinite set, ISI could be F 18. For a context-free grammar G to have the weak generative capacity for a language L, G must be able to generate some of the strings in L, but it does not need to be able to generate all of them L2), Li CFLs, and L2 is a regular language. It is possible that 19, L = (Li n L e CFLs F F 20. Nondeterministic and deterministic PDA recognize the same set of languages