Question 21
Which of the following is a universal Turing-machine property?
A UTM simulates other TMs from their finite encodings.
Which of the following is a universal Turing-machine property?
A UTM simulates other TMs from their finite encodings.
Under the standard configuration notation u q v, which symbol is scanned by the head?
The notation places the current state between the portion left of the head and the portion beginning at the scanned symbol.
Which operation is guaranteed to preserve recursive languages?
Recursive languages are closed under complement, as well as union, intersection, concatenation, and star.
Which operation is NOT guaranteed to preserve RE languages?
RE is closed under union, intersection, and concatenation, but not complement.
Which operation preserves CFLs when one operand is regular?
CFLs are closed under intersection with regular languages.