Select all that is true of the following CFG and the corresponding PDA:Group of answer choicesAt the end there is a non terminal symbol on the stack when the machine haltsThe machine has 6 stacks of memoryThe tape only contains terminal symbolsThe CFG grammar uses 1 more non terminal symbol than the PDAThe grammar generates the string "Alice ran"

A CFG G is given with the following productions where S is the start symbol, A is a non-terminal and a and b are terminals. aabbaba aabaaba abababb aabbaab

Select all statements equivalent to "Language A is decidable by a TM."1 pointA is decidable by a C programA is decidable by a Python programA is decidable by a NFAA is decidable by a PDAA is decidable by a context-free grammar

Consider the PDA with only transitions (q0, a, e) -> (q0, e) for each symbol a in the input alphabet. q0 is an accepting state. i.e., from the initial state, it consumes one input symbol, does no stack operations and stays in the same state. What is the language decided by this PDA?1 pointEmpty set{ e }Sigma*This is an invalid PDA.

In the standard simulation of a grammar by a PDA, what are the symbols allowed in the stack alphabet1 pointInput symbolsGrammar variables$Grammar rules

Select all true statements1 pointThere is a TM that loops on all inputsLet A be any decidable language. There is a TM that loops on exactly the strings not in A.Let A be any decidable language. There is a TM that loops on exactly the strings in A.There is an undecidable language A such that there is a TM that halts on exactly the strings in A.There is an undecidable language A such that the complement of A is decidable.There is a decidable language A such that the complement of A is undecidable.