A FSM can be considered, having finite tape length without rewinding capability and unidirectional tape movement
A) Turing machine
B) Pushdown automata
C) Context free languages
D) Regular languages
Correct Answer:
Verified
Q10: A PC not connected to a network
Q11: Recursively enumerable languages are not closed under:
A)Union
B)Intersection
C)Complementation
D)Concatenation
Q12: Let L1 be a recursive language, and
Q13: Let S be an NP-complete problem, Q
Q14: For s ? (0+1)* let d(s) denote
Q16: Which of the following statement is true?
A)All
Q17: Recursively enumerable languages are not closed under
A)Complementation
B)Union
C)Intersection
D)None
Q18: The following CFG is in
S ? Abb
B
Q19: The languages -------------- are the examples of
Q20: Let L be any infinite regular language,
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents