Question

How would you design a PDA to recognize the language of binary strings that end with a different symbol than they start with?

score 280 · Answer 1 · 2020-10-17 06:56:11

280

Views

How would you design a PDA to recognize the language of binary strings that end with a different symbol than they start with?

Published on 17 Oct 2020 - 6:56

score 98 · Answer 2 · 2020-10-19 19:13:23

98

Views

What language is generated by this grammar?

Published on 19 Oct 2020 - 19:13

score 666 · Answer 3 · 2020-10-22 15:32:51

666

Views

The Language generated by the grammar

Published on 22 Oct 2020 - 15:32

score 45 · Answer 4 · 2020-11-01 21:40:19

45

Views

Ambiguity in a grammar and getting rid of it

Published on 01 Nov 2020 - 21:40

score 483 · Answer 5 · 2020-11-02 03:41:12

483

Views

show that a language is context-free by giving a pushdown automaton that accepts the language

Published on 02 Nov 2020 - 3:41

score 274 · Answer 6 · 2020-11-08 16:19:31

274

Views

Give a context-free grammar that generate this language

Published on 08 Nov 2020 - 16:19

score 146 · Answer 7 · 2020-11-09 01:49:15

146

Views

Struggling to describe the language that this pushdown automaton represents

Published on 09 Nov 2020 - 1:49

score 142 · Answer 8 · 2020-11-09 17:04:59

142

Views

Give the context-free grammar that generates the pushdown automaton language

Published on 09 Nov 2020 - 17:04

score 108 · Answer 9 · 2026-03-25 23:37:08

108

Views

Give an expression that describe the language generated by this grammar

Published on 25 Mar 2026 - 23:37

score 248 · Answer 10 · 2020-11-12 15:01:25

248

Views

$L=(\{ca^nb^n | n \geq 0\} \cup \{a^nb^{2n } | n \geq 0\})^*$ is not dcfl. Why?

Published on 12 Nov 2020 - 15:01

score 142 · Answer 11 · 2026-03-28 05:22:35

142

Views

Counting the number of expressions of a given length

Published on 28 Mar 2026 - 5:22

score 893 · Answer 12 · 2026-03-25 18:48:14

893

Views

Use the pumping lemma to show that the language is not context-free

Published on 25 Mar 2026 - 18:48

score 303 · Answer 13 · 2020-11-14 19:17:14

303

Views

Show that this language is context-free by giving a pushdown automaton

Published on 14 Nov 2020 - 19:17

score 2.6k · Answer 14 · 2026-03-25 18:48:07

2.6k

Views

Proving that the language $\{a^{i} b^{j} c^{k} : i < j < k\}$ is not Context Free using Pumping Lemma

Published on 25 Mar 2026 - 18:48

score 407 · Answer 15 · 2026-03-25 18:50:16

407

Views

Proving the language $\{w \in \{0, 1\}^{\ast} : w = w^{R}$, $|w|_{0} = |w|_{1} \}$ is not Context Free using Pumping Lemma

Published on 25 Mar 2026 - 18:50

List Question

How would you design a PDA to recognize the language of binary strings that end with a different symbol than they start with?

What language is generated by this grammar?

The Language generated by the grammar

Ambiguity in a grammar and getting rid of it

show that a language is context-free by giving a pushdown automaton that accepts the language

Give a context-free grammar that generate this language

Struggling to describe the language that this pushdown automaton represents

Give the context-free grammar that generates the pushdown automaton language

Give an expression that describe the language generated by this grammar

$L=(\{ca^nb^n | n \geq 0\} \cup \{a^nb^{2n } | n \geq 0\})^*$ is not dcfl. Why?

Counting the number of expressions of a given length

Use the pumping lemma to show that the language is not context-free

Show that this language is context-free by giving a pushdown automaton

Proving that the language $\{a^{i} b^{j} c^{k} : i < j < k\}$ is not Context Free using Pumping Lemma

Proving the language $\{w \in \{0, 1\}^{\ast} : w = w^{R}$, $|w|_{0} = |w|_{1} \}$ is not Context Free using Pumping Lemma

Trending Questions

Popular # Hahtags

Popular Questions