Dark Mode

Recent questions tagged context-free-language

0 votes

0 answers

1

Best Open Video Playlist for Regular and Context-free Languages Topic | Theory of compuation
Please list out the best free available video playlist for Regular and Context-free Languages Topic from Theory of compuation as an answer here (only one playlist per answer). We'll then select the best ... are more likely to be selected as best. For the full list of selected videos please see here

makhdoom ghaya asked in Others Aug 18

by makhdoom ghaya

16 views

0 votes

1 answer

2

Context free language
Why the complement of a CFL is CSL?

swami_9 asked in Theory of Computation Jul 16

153 views

0 votes

1 answer

3

Dcfl union Regular not always dcfl?
$L=\{a^mb^n\mid m≠n\}∪{(a+b)^∗b(b+a)^*a(a+b)^∗}$ $\implies L = \;\{a^mb^n\mid m<n\} \cup \{a^mb^n\mid m>n\} \cup (a+b)^*b(a+b)^*a(a+b)^*$ It is DCFL ∪ Regular, hence it should be DCFL, but not able to design DPDA, always it designed as NPDA. Can anybody make a DPDA for $L$?

juuniversity asked in Theory of Computation Jun 23

by juuniversity

84 views

1 vote

1 answer

4

identify language is regular or not L={wcw^r | w,c belongs to E*} E={a,b}
identify language is regular or not L={wcw^r | w,c belongs to E*} E={a,b} if yes then why please explain

sachin_27 asked in Theory of Computation Jun 1

143 views

1 vote

0 answers

5

Self Doubt about Construction of CFG
I am trying to construct a CFG for this following langauge: L = $\{0^i 1^j | i \neq j \ and \ i, j > 0\}$, this is what I came up with: $ S \rightarrow A \ | \ B $ $A \rightarrow 0A1 \ |\ A1 \ |\ 011$ ... strings that we can have: s = {011, 00111, 001, 00011, ...} and it worked. So, my question is, is this correct CFG for this particular L?

HenryAsks21 asked in Theory of Computation Apr 30

63 views

4 votes

2 answers

6

GATE CSE 2022 | Question: 37
Consider the following languages: $L_{1} = \{ a^{n} wa^{n} | w \in \{a,b\}^{\ast}\}$ $L_{2} = \{wxw^{R} | w, x \in \{a,b\}^{*}, |w|, |x| > 0 \}$ Note that $w^{R}$ is the reversal of the string $w.$ Which of the following is/are ... $L_{2}$ are context-free. $L_{1}$ is regular and $L_{2}$ is context-free. $L_{1}$ and $L_{2}$ are context-free but not regular.

Arjun asked in Theory of Computation Feb 15

by Arjun

1.2k views

5 votes

2 answers

7

GATE CSE 2022 | Question: 38
Consider the following languages: $L_{1} = \{ ww | w \in \{a,b\}^{\ast} \}$ $L_{2} = \{a^{n} b^{n} c^{m} | m,n \geq 0 \}$ $L_{3} = \{a^{m} b^{n} c^{n} | m,n \geq 0 \}$ Which of the following statements is/are $\text{FALSE}?$ ... $L_{2}$ is context-free. $L_{2}, L_{3}$ and $L_{2} \cap L_{3}$ all are context-free. Neither $L_{1}$ nor its complement is context-free.

Arjun asked in Theory of Computation Feb 15

by Arjun

2.1k views

1 vote

2 answers

8

DCFL - TOC
Is the following language a DCFL? Please explain your reasoning.

atulcse asked in Theory of Computation Jan 21

309 views

0 votes

1 answer

9

parse tree - context-free grammars - TOC
Given a CFG and a string, what is the relation between the number of leftmost derivations, the number of rightmost derivations and the number of parse trees?

atulcse asked in Theory of Computation Jan 21

342 views

0 votes

2 answers

10

made easy test series - parsing - context-free grammar
Consider the following context-free grammar: Find the number of unique productions in {Goto (A → D.BC, B) U Goto (A → .DBC, D)}

atulcse asked in Compiler Design Jan 16

259 views

3 votes

2 answers

11

#Gate CS Applied Course Mock Test
Is this Language a CFL? If yes, Can you please explain the implementation.

Rajesh Reddy asked in Theory of Computation Jan 3

by Rajesh Reddy

310 views

2 votes

2 answers

12

regular and cfl
if L1 and L2 are not regular language then L1 union L2 is not regular. this statement is true or false? my approach is::: true let suppose L1= a^n b^n AND L2= a^k b^k both are cfl but if we do union then that also be cfl and what happened if union is replaced by concatenation L1 . L2

jugnu1337 asked in Theory of Computation Dec 23, 2021

443 views

0 votes

1 answer

13

Closure Properties of Languages
let L = “CFL but not REGULAR”, Can we get complement of L as CFL? Unlike in the case of Recursively Enumerable(RE) language where if L = “RE but not RECURSIVE”, its complement can never be RE.

UltraRadiantX asked in Theory of Computation Oct 9, 2021

by UltraRadiantX

247 views

1 vote

1 answer

14

Applied Test Series
The language accepted by the given PDA is

LRU asked in Theory of Computation Oct 3, 2021

by LRU

164 views

1 vote

2 answers

15

can someone share the approach for the following que
14.Show that the grammar S → aSb |SS| e is ambiguous, but that the language denoted by it is not. Can someone share the approach for second part.

mk_007 asked in Theory of Computation Oct 3, 2021

by mk_007

137 views

2 votes

3 answers

16

UGC NET CSE | June 2016 | Part 3 | Question: 56
Let $L=\{0^n1^n|n\ge 0\}$ be a context free language. Which of the following is correct? $\overline L$ is context free and $L^k$ is not context free for any $k\ge1$ $\overline L$ is not context free and $L^k$ ... $L^k$ for any $k\ge1$ are context free Both $\overline L$ and $L^k$ for any $k\ge1$ are not context free

soujanyareddy13 asked in Theory of Computation May 10, 2021

by soujanyareddy13

417 views

13 votes

2 answers

17

GATE CSE 2021 Set 2 | Question: 41
For a string $w$, we define $w^R$ to be the reverse of $w$. For example, if $w=01101$ then $w^R=10110$. Which of the following languages is/are context-free? $\{ wxw^Rx^R \mid w,x \in \{0,1\} ^* \}$ $\{ ww^Rxx^R \mid w,x \in \{0,1\} ^* \}$ $\{ wxw^R \mid w,x \in \{0,1\} ^* \}$ $\{ wxx^Rw^R \mid w,x \in \{0,1\} ^* \}$

Arjun asked in Theory of Computation Feb 18, 2021

by Arjun

3.1k views

Page:

1
2
3
4
5
6
...
19
next »

Recent questions tagged context-free-language