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.