true/false for #13 & 14

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, I01 -o, and if S is an infinite set, ISI could be wW na0) is the second string in a IS M). The start state of M is not an accept state 13. It is possible that a DFSM M could decide if wE L(M) without visiting any state more than once. F 14. Let ?-{a,b), and L-{ w : lwl is even, or if I wl is odd then w starts with bby. For example, aaba E L, bba e L, but bab e L and b EL. Also, let the regular expression R ((aub) (a u b))u bb(a ub) w E L iff w matches R. F