GATE 2005-IT
March 19, 2025GATE 2007
March 20, 2025GATE 2005-IT
|
Question 6
|
The language {0n 1n 2n | 1 ≤ n ≤ 106} is
|
regular
|
|
|
context-free but not regular
|
|
|
context-free but its complement is not context-free
|
|
|
not context-free
|
Question 6 Explanation:
In this the value of n is finite then we can be able to construct a finite state automata for this language.
So, given language is regular.
So, given language is regular.
Correct Answer: A
Question 6 Explanation:
In this the value of n is finite then we can be able to construct a finite state automata for this language.
So, given language is regular.
So, given language is regular.