___________ states are called the halt states.
A) ACCEPT and REJECT
B) ACCEPT and READ
C) ACCEPT AND START
D) ACCEPT AND WRITE
Correct Answer:
Verified
Q15: A FSM can be considered, having finite
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,
Q21: Languages are proved to be regular or
Q23: The part of an FA, where the
Q24: The PDA is called non-deterministic PDA when
Q25: If an effectively solvable problem has answered
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