true/false

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 2. 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, 10I o, and if S is an infinite set, ISI could be 24. The LHS of a CFG rewrite rule must consist of a single terminal symbol. 25. The RHS of a CFG rewrite rule could mix terminals and non-terminals. 26. S Sb could be a valid rewrite rule in a CFG, where S is the start symbol