Theory of Automata & Formal Languages MCQs

The correct answer is a language accepted by a Turing machine that may not halt on non-members.

CFG simplification is correctly described as removing useless, unreachable, or non-generating symbols and unnecessary productions.

Chomsky Normal Form is correctly described as a CFG form where productions are mainly A -> BC or A -> a, with limited epsilon handling.

recognizable language is correctly described as a language accepted by a Turing machine that may not halt on non-members.

In this course context, CFG simplification means removing useless, unreachable, or non-generating symbols and unnecessary productions.

In this course context, Chomsky Normal Form means a CFG form where productions are mainly A -> BC or A -> a, with limited epsilon handling.

In this course context, recognizable language means a language accepted by a Turing machine that may not halt on non-members.

The suitable explanation is removing useless, unreachable, or non-generating symbols and unnecessary productions.

The suitable explanation is a CFG form where productions are mainly A -> BC or A -> a, with limited epsilon handling.

The suitable explanation is a language accepted by a Turing machine that may not halt on non-members.

The correct answer is a grammar symbol that does not contribute to deriving terminal strings from the start symbol.

The correct answer is a CFG form where productions begin with a terminal followed by zero or more non-terminals.