Which statement is true?

(A) The tape of turing machine is infinite
(B) The tape of turing machine is finite
(C) The tape of turing machine is infinite when the language is regular
(D) The tape of turing machine is finite when the language is nonregular

»Important Links:

Latest Jobs in Pakistan Govt Jobs in Pakistan Private Jobs
NTS Jobs Bank Jobs Teaching Jobs
Police Jobs Wapda Jobs Army Jobs
PPSC Jobs Nadra Jobs CTSP Jobs

Leave a Reply

Your email address will not be published. Required fields are marked *

error: Content is protected !!