Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Context Free Languages and Pushdown Automata Pushdown Automata
Consider the following sets
I) \(\left\{ {{0^p}{0^q} + {1^p}{1^q}{\rm{|}}0 \le p \le q} \right\}\)
II) \(\left\{ {{\rm{\omega }}x{\rm{\omega |\omega }},x \epsilon \left\{ {0,1} \right\}*} \right\}\)
1
I is DCFL but not regular, II is CFL but not DCFL
2
I is CFL but not DCFL, II is DCFL but not Regular
3
Bothe are CFL but not DCFL
4
Both are regular