A formal language is recursive if :
Posted: Thu Jul 14, 2022 9:26 am
a) a total turing machine exists
b) a turing machine that halts for every input
c) turing machine rejects if the input does not belong to the language
d) all of the mentioned
b) a turing machine that halts for every input
c) turing machine rejects if the input does not belong to the language
d) all of the mentioned