M

Mr. Dubey • 53.53K Points
Coach 

Q. Which of the following conversion is not possible (algorithmically)?

(A) regular grammar to context-free grammar
(B) non-deterministic finite state automata to deterministic finite state automata
(C) non-deterministic pushdown automata to deterministic pushdown automata
(D) none deterministic turing machine to deterministic turing machine
Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. In the __________ normal form, a composite attribute is converted to individual attributes.

Q. The information we need to capture during requirements analysis not include

Q. Find the maximum value output assuming items to be divisible.

Q. What is start frame delimeter (SFD) in ethernet frame?

Q. Choose THREE (3) senses in Multi-modal Technology i. Touch ii. Smell iii. Sound iv. Instinct

Q. Steganography follows the concept of security through obscurity.

Q. Mostly is used in wireless LAN.

Q. M-ary modulation schemes have very good power efficiency.

Q. The disadvantage of a process being allocated all its resources before beginning its execution is

Q. The situation in linked list START = NULL is called_________

Question analytics