True or False

Please circle final answer

11. The LHS of a CFG rule must be a single non-terminal 12. A CFG for a language L is called ambiguous if there is a string whose membership in L cannot be decided. 13. CFGs permit recursion (for example, including the LHS in the RHS of a rewrite rule). 14. Every CFL can be recognized by a PDA and generated by a CFG. 15. An NDFSM can be considered as a PDA that ignores its stack