Recent questions tagged context-free-languages - GATE CSE Doubts

0 votes

0 answers

TOC Ace test series

asked Jan 19 in Theory of Computation by Chirag Shilwant (179 points) | 5 views

0 votes

1 answer

ace test series toc cfl rel
Q.

asked Jan 11 in Theory of Computation by Rahul Burman (21 points) | 19 views

0 votes

1 answer

Class of given language
Is the language $L = \{a^m b^n | m +n = p \}$ a CFL? Nothing is mentioned in the question, so I just assumed that m,n,p >= 0.

asked Jan 7 in Theory of Computation by goxul (373 points) | 40 views

0 votes

0 answers

MADE EASY TEST SERIES CFL
Which of the following languages is CFL? (a) ${{a^{m}b^{n}c^{n} | m != n}}$ (b) ${a^{m}b^{n}c^{k} | if (m==n) then (n!=k) }$ (C) ${a^{m}b^{n}c^{k} | (m>n) or (n<k) }$ (d) None of the above

asked Jan 7 in Theory of Computation by tamaldeepmaity (17 points) | 37 views

0 votes

0 answers

MADE EASY fyll length test series
If the given language $L:\{(aa)^n (bb)^m (aa)^n|m,n>=0\}$ & homomorphic function $h(0)=aa$ $h(1)=bb$ $h(2)=aa$ Then $h^{-1}(L)$ will be $\{0^n 1^m 2^n|m,n>=0\}$ $\{2^n 1^m 0^n |m,n>=0\}$ $\{0^n 1^n 0^n|m,n>=0\}$ none of the above Ans is D

asked Dec 30, 2019 in Theory of Computation by SHARMISTHA CHOUDHURY (7 points) | 31 views

0 votes

1 answer

MadeEasy FULL SYLLABUS TEST-1 (BASIC LEVEL) GATE 2020 Q51

asked Dec 29, 2019 in Theory of Computation by DukeThunders (415 points) | 62 views

0 votes

0 answers

CFL and Regular language
If L is not context-free and F is finite, then L \ F is not context-free. True or False? If true, how would you prove it?

asked Dec 21, 2019 in Theory of Computation by goxul (373 points) | 15 views

0 votes

0 answers

Why the name Context Free and Context Sensitive?
Why do we call CFG as Context Free and CSL as Context Sensitive? I am searching this since a long time but could not find an answer.

asked Dec 21, 2019 in Theory of Computation by AkashChandraGupta (6 points) | 8 views

0 votes

0 answers

MOCK TEST ACE TOC
Consider the following questions over $\sum = \begin{Bmatrix} a,b \end{Bmatrix}$ $L_{1} = \begin{Bmatrix} ww | w \in \begin{Bmatrix} a,b \end{Bmatrix}* \end{Bmatrix}$ $L_{2}$ = Complement of $L_{1}$ $L_{3} = L_{1} \bigcup L_{2}$ Which of the above languages is/are Recursively Enumerable but not Context Free Language?

asked Dec 16, 2019 in Theory of Computation by tamaldeepmaity (17 points) | 19 views

0 votes

0 answers

#grammar context free
consider the following context-free language L:{[email protected]$^{R}$ is substing for x,where w,x$\epsilon (a+b)^{\ast }$} . which of follwoing CFG will reprsent above language : A) $S\rightarrow QP$ $P\rightarrow aPa|bQb|@Q$ $Q\rightarrow aQ|bQ|\epsilon$ B) $S\rightarrow PQ$ $P\rightarrow aPa|bQb|@Q$ $Q\rightarrow aQ|bQ|\epsilon$ C) both a and b D) none of these

asked Nov 28, 2019 in Theory of Computation by amit166 (138 points) | 10 views

0 votes

0 answers

Testbook Test Series-TOC
$\\ L_{1}= (0^m1^m0^n | m,n>0) \ \ \ \ \ L_{2}=(0^m1^n0^n |m,n>0)\\ L_{1}\cup L_{2} \ ?\\ \\ 1. Dcfl\\ 2. Cfl\\ 3.Unambiguous\\ 4.Inherently \ ambiguous$ Answer given as 2 and 4 and I am facing difficulty to understand the 4th option. Please if any idea to anyone, do tell.

asked Oct 2, 2019 in Theory of Computation by Kushagra गुप्ता (176 points) | 62 views

0 votes

2 answers

Identify the class of the language
L = {PQ | P,Q $\in (a,b)^{*}$ and $n_{a}(P) = n_{b}(Q)$} The language is – DCFL but not Regular CSL but not CFL CFL but not DCFL Regular

asked Sep 5, 2019 in Theory of Computation by MRINMOY_HALDER (37 points) | 34 views

+1 vote

1 answer

a language is CFL or not
$L_{1} = { 0^{m}1^{n}| n\leq m\leq 2n}$ why this is CFL ????

asked Aug 28, 2019 in Theory of Computation by MRINMOY_HALDER (37 points) | 24 views

0 votes

3 answers

CFL or not ( test series qsn)
This language is CFL or not – $\Sigma = \{ a,b \} $ and $L = \{ x \# y\ |\ x,y \in \Sigma^*\ , \#\ is \ a \ constant\ and\ x \neq y \}$ please give the reason also

asked Aug 28, 2019 in Theory of Computation by MRINMOY_HALDER (37 points) | 200 views

0 votes

0 answers

It is CFL or not
It is CFL or not $\{wa^n w^r |\ w\ \in (a+b)^*, n>=0 \}$

asked Aug 21, 2019 in Theory of Computation by Sandeep Verma (13 points) | 25 views

+1 vote

1 answer

The language is context free or not
consider this language: L={(a^n b^n)^2 :n>=0} Is this context free?

asked Aug 20, 2019 in Theory of Computation by Doraemon (91 points) | 32 views

0 votes

1 answer

Context free language
Is the given language CFL or not? Σ*-L={a^n b^n a^n| n>=1}

asked Aug 14, 2019 in Theory of Computation by kshubham538 (-5 points) | 21 views

0 votes

1 answer

DCFG Self Doubt
if $a^nb^n$ is DCFL the is $(a^nb^n)$* DCFL?

asked Aug 9, 2019 in Theory of Computation by aditi19 (55 points) | 25 views

+2 votes

4 answers

fssai IT assistant exam 2019 Q15
What is the maximum number of language a context-free Grammar (CFG) can generate? Three Two One Infinite

asked Jul 31, 2019 in Compiler Design by akshat sinha (12 points) | 157 views

–1 vote

1 answer

Ambiguity related to Context free grammar

asked Jul 28, 2019 in Theory of Computation by kshubham538 (-5 points) | 31 views

0 votes

1 answer

Context free grammar

asked Jul 25, 2019 in Theory of Computation by kshubham538 (-5 points) | 28 views

0 votes

2 answers

Self Doubt: Why is "intersection with regular languages" closed for context free languages ?

asked Jul 20, 2019 in Theory of Computation by commenter commenter (31 points) | 15 views

To see more, click for the full list of questions or popular tags.

3,314 questions

1,581 answers

10,271 comments

89,904 users