Question

PDA that accepts L $\{a^i b^j c^k \mid i,j,k≥0 \text{ and } i=j \text{ or } i=k\}$

score 1.1k · Answer 1 · 2026-03-27 04:00:03

1.1k

Views

PDA that accepts L $\{a^i b^j c^k \mid i,j,k≥0 \text{ and } i=j \text{ or } i=k\}$

Published on 27 Mar 2026 - 4:00

score 51 · Answer 2 · 2020-03-11 11:13:21

51

Views

Inverse image of the image of a formal language and vice versa

Published on 11 Mar 2020 - 11:13

score 623 · Answer 3 · 2026-03-27 04:03:32

623

Views

Cardinals of the set of all languages $L=L^*$ over $\Sigma=\{a\}$.

Published on 27 Mar 2026 - 4:03

score 145 · Answer 4 · 2026-03-26 22:50:18

145

Views

Identifying redexes in a lambda expression

Published on 26 Mar 2026 - 22:50

score 175 · Answer 5 · 2026-03-26 21:07:23

175

Views

Parentheses placement and identifying redexes in a lambda expression

Published on 26 Mar 2026 - 21:07

score 377 · Answer 6 · 2026-03-25 04:40:41

377

Views

What is the difference between pumping Lemma for regualar languages and pumping lemma for context free languages?

Published on 25 Mar 2026 - 4:40

score 213 · Answer 7 · 2026-03-25 04:40:57

213

Views

How to prove that a language is not regular without the use of the Pumping Lemma?

Published on 25 Mar 2026 - 4:40

score 91 · Answer 8 · 2020-03-30 02:21:39

91

Views

How exactly does the placement of parenthesis change a material conditional in propositional logic?

Published on 30 Mar 2020 - 2:21

score 71 · Answer 9 · 2026-03-25 09:39:59

71

Views

Defining a grammar $G$ for the language $\mathcal L(G) = \{a^i b^j c^k \mid 0 \leq i < j < k\}$

Published on 25 Mar 2026 - 9:39

score 50 · Answer 10 · 2026-03-25 22:10:48

50

Views

Which symbols in the following grammar $G$ are generating?

Published on 25 Mar 2026 - 22:10

score 108 · Answer 11 · 2026-03-26 22:50:25

108

Views

Lambda calculus expression evaluation.

Published on 26 Mar 2026 - 22:50

score 51 · Answer 12 · 2026-03-27 00:43:39

51

Views

Turing decidability

Published on 27 Mar 2026 - 0:43

score 685 · Answer 13 · 2026-03-25 06:02:07

685

Views

Why is the minimal pumping length for $(01)^*$ equal to 1?

Published on 25 Mar 2026 - 6:02

score 131 · Answer 14 · 2026-03-26 03:12:43

131

Views

What is the regular expression of the language accepted by the following NFA?

Published on 26 Mar 2026 - 3:12

score 37 · Answer 15 · 2020-04-05 05:38:13

37

Views

Decidability problem and Turing machine

Published on 05 Apr 2020 - 5:38

List Question

PDA that accepts L $\{a^i b^j c^k \mid i,j,k≥0 \text{ and } i=j \text{ or } i=k\}$

Inverse image of the image of a formal language and vice versa

Cardinals of the set of all languages $L=L^*$ over $\Sigma=\{a\}$.

Identifying redexes in a lambda expression

Parentheses placement and identifying redexes in a lambda expression

What is the difference between pumping Lemma for regualar languages and pumping lemma for context free languages?

How to prove that a language is not regular without the use of the Pumping Lemma?

How exactly does the placement of parenthesis change a material conditional in propositional logic?

Defining a grammar $G$ for the language $\mathcal L(G) = \{a^i b^j c^k \mid 0 \leq i < j < k\}$

Which symbols in the following grammar $G$ are generating?

Lambda calculus expression evaluation.

Turing decidability

Why is the minimal pumping length for $(01)^*$ equal to 1?

What is the regular expression of the language accepted by the following NFA?

Decidability problem and Turing machine

Trending Questions

Popular # Hahtags

Popular Questions