Basics Of Automata - Online Test

Test Difficulty Level: Medium

Syllabus of Test

Computer Science: Questions from the basics of Automata.

Sample Question from this online test:

Question: Which of the following is not possible algorithmically

Option A: regular grammar to context free grammar

Option B: non-deterministic finite state Automata to deterministic FSA

Option C: non-deterministic PDA to deterministic PDA

Option D: none of these

To answer, click the "Start This Test" button below.

Start this Test






Comments

abhishek chaturvedi on 2011-01-24 16:57:51 wrote,

check q.no.7,17

Sushmita Mallick on 2013-06-28 16:10:40 wrote,

please check question no. 9 & 12