Formal Language & Automata Theory - Online Test

Test Difficulty Level: Medium

Syllabus of Test

Questions based on the Formal Language & Automata Theory.

Sample Question from this online test:

Question: A Push Down Machine (PDM) behaves like a Turing Machine (TM) when the number of auxiliary memory it has, is

Option A: 2

Option B: 1

Option C: 0

Option D: 4

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

Start this Test






Comments

Gaurav Singh on 2013-10-23 19:53:44 wrote,

Question 9 given ans is wrong