Select the following statements that are considered true.

Group of answer choices

NPDAs can recognize all languages that a Turing Machine can recognize.

All context$-$free languages are recursively enumerable $($RE$).$

All Context$-$Free Languages are considered Deterministic Context$-$Free Languages.

Some S$-$Grammars can be considered a right linear grammar.

All regular grammars can generate context$-$free languages.

All s$-$grammars are considered ambiguous.

All linear grammars are considered regular.

A Turing Machine's tape is finite.

A context$-$free grammar can generate every possible language in the universe.

Some S$-$Grammars can be considered a left linear grammar.

NPDAs can be used to recognize regular languages.

All context$-$free languages are considered regular languages.

Any pushdown automata's language can be generated by a context$-$free grammar.