Theory of Computation and Compiler Design MCQ: The language L = { 0^i 2 1 ^i i>-0 } over the alphabet (0,1,2) is

← All Theory of Computation and Compiler Design questions

The language L = { 0^i 2 1 ^i i>-0 } over the alphabet (0,1,2) is

Correct Answer: is recursive and deterministic CFL

Make the most of this question

This page focuses on one Theory of Computation and Compiler Design question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.

← More Theory of Computation and Compiler Design MCQs All Engineering topics Mock test hub