Practice Library
All MCQs
Browse exam-wise, subject-wise, and country-wise MCQs with explanations.
Choose an option to check your answer.
A.
a DFA with exactly one transition
B.
a restricted Turing machine whose tape is bounded by a linear function of input length
C.
a PDA with no stack
D.
a TM with infinite output symbols only
Show Answer
Correct Answer: B. a restricted Turing machine whose tape is bounded by a linear function of input length
Explanation:
The correct answer is a restricted Turing machine whose tape is bounded by a linear function of input length.
Choose an option to check your answer.
A.
a language with no decision procedure in all cases
B.
a language generated only by a regular expression
C.
a language that cannot use terminals
D.
a language generated by a context-sensitive grammar
Show Answer
Correct Answer: D. a language generated by a context-sensitive grammar
Explanation:
The suitable explanation is a language generated by a context-sensitive grammar.
Choose an option to check your answer.
A.
a language generated only by a regular expression
B.
a language that cannot use terminals
C.
a language with no decision procedure in all cases
D.
a language generated by a context-sensitive grammar
Show Answer
Correct Answer: D. a language generated by a context-sensitive grammar
Explanation:
In this course context, context-sensitive language means a language generated by a context-sensitive grammar.
Choose an option to check your answer.
A.
a language generated by a context-sensitive grammar
B.
a language that cannot use terminals
C.
a language generated only by a regular expression
D.
a language with no decision procedure in all cases
Show Answer
Correct Answer: A. a language generated by a context-sensitive grammar
Explanation:
context-sensitive language is correctly described as a language generated by a context-sensitive grammar.
Choose an option to check your answer.
A.
a language generated by a context-sensitive grammar
B.
a language with no decision procedure in all cases
C.
a language that cannot use terminals
D.
a language generated only by a regular expression
Show Answer
Correct Answer: A. a language generated by a context-sensitive grammar
Explanation:
The correct answer is a language generated by a context-sensitive grammar.
Choose an option to check your answer.
A.
a grammar with no non-terminals
B.
a grammar where the left side is always a terminal
C.
a grammar whose productions do not decrease string length, except limited start-symbol epsilon cases
D.
a grammar equivalent to every DFA
Show Answer
Correct Answer: C. a grammar whose productions do not decrease string length, except limited start-symbol epsilon cases
Explanation:
The suitable explanation is a grammar whose productions do not decrease string length, except limited start-symbol epsilon cases.
Choose an option to check your answer.
A.
a grammar with no non-terminals
B.
a grammar where the left side is always a terminal
C.
a grammar whose productions do not decrease string length, except limited start-symbol epsilon cases
D.
a grammar equivalent to every DFA
Show Answer
Correct Answer: C. a grammar whose productions do not decrease string length, except limited start-symbol epsilon cases
Explanation:
In this course context, context-sensitive grammar means a grammar whose productions do not decrease string length, except limited start-symbol epsilon cases.
Choose an option to check your answer.
A.
a grammar whose productions do not decrease string length, except limited start-symbol epsilon cases
B.
a grammar equivalent to every DFA
C.
a grammar with no non-terminals
D.
a grammar where the left side is always a terminal
Show Answer
Correct Answer: A. a grammar whose productions do not decrease string length, except limited start-symbol epsilon cases
Explanation:
context-sensitive grammar is correctly described as a grammar whose productions do not decrease string length, except limited start-symbol epsilon cases.
Choose an option to check your answer.
A.
a grammar with no non-terminals
B.
a grammar equivalent to every DFA
C.
a grammar where the left side is always a terminal
D.
a grammar whose productions do not decrease string length, except limited start-symbol epsilon cases
Show Answer
Correct Answer: D. a grammar whose productions do not decrease string length, except limited start-symbol epsilon cases
Explanation:
The correct answer is a grammar whose productions do not decrease string length, except limited start-symbol epsilon cases.
Choose an option to check your answer.
A.
a language generated only by regular expressions
B.
a language accepted by a Turing machine that may not halt on non-members
C.
a language that must be finite
D.
a language accepted only by Moore machines
Show Answer
Correct Answer: B. a language accepted by a Turing machine that may not halt on non-members
Explanation:
The suitable explanation is a language accepted by a Turing machine that may not halt on non-members.
Choose an option to check your answer.
A.
a language accepted by a Turing machine that may not halt on non-members
B.
a language accepted only by Moore machines
C.
a language that must be finite
D.
a language generated only by regular expressions
Show Answer
Correct Answer: A. a language accepted by a Turing machine that may not halt on non-members
Explanation:
In this course context, recognizable language means a language accepted by a Turing machine that may not halt on non-members.
Choose an option to check your answer.
A.
a language accepted only by Moore machines
B.
a language that must be finite
C.
a language accepted by a Turing machine that may not halt on non-members
D.
a language generated only by regular expressions
Show Answer
Correct Answer: C. a language accepted by a Turing machine that may not halt on non-members
Explanation:
recognizable language is correctly described as a language accepted by a Turing machine that may not halt on non-members.
