Question

Necessary and Sufficient Conditions for x and A

score 65 · Answer 1 · 2026-04-11 22:59:37

65

Views

Necessary and Sufficient Conditions for x and A

Published on 11 Apr 2026 - 22:59

score 72 · Answer 2 · 2026-05-10 14:02:19

72

Views

Finding a regular expression for a given language

Published on 10 May 2026 - 14:02

score 106 · Answer 3 · 2026-04-10 02:20:23

106

Views

Understanding the second condition of the pumping lemma

Published on 10 Apr 2026 - 2:20

score 1.2k · Answer 4 · 2026-04-20 22:08:46

1.2k

Views

How to draw a DFA from regular expression ab?

Published on 20 Apr 2026 - 22:08

score 188 · Answer 5 · 2026-05-10 14:03:56

188

Views

Prove that Language is not regular using pumping lemma

Published on 10 May 2026 - 14:03

score 1.8k · Answer 6 · 2026-05-10 14:07:23

1.8k

Views

Show that $\{a^i b^j c^k \mid i>j>k>0\}$ is not a context free language by using pumping lemma

Published on 10 May 2026 - 14:07

score 383 · Answer 7 · 2026-04-13 05:15:38

383

Views

Proving equality of two regular languages using operations closed under regular languages

Published on 13 Apr 2026 - 5:15

score 1.5k · Answer 8 · 2026-05-10 14:06:42

1.5k

Views

Use Pumping Lemma to show that $L_7$ is not context-free

Published on 10 May 2026 - 14:06

score 118 · Answer 9 · 2026-05-10 14:04:48

118

Views

proof that a language is a regular according to another language

Published on 10 May 2026 - 14:04

score 88 · Answer 10 · 2026-04-13 18:58:41

88

Views

How to use product automaton and intermediate state to prove existence of regular language?

Published on 13 Apr 2026 - 18:58

score 590 · Answer 11 · 2026-05-10 15:10:34

590

Views

Inductive Proof With Regular Expression

Published on 10 May 2026 - 15:10

score 2.2k · Answer 12 · 2026-05-10 15:14:01

2.2k

Views

If RS is equivalent to SR, then RS is equivalent to SR (Proof by Contradiction)

Published on 10 May 2026 - 15:14

score 268 · Answer 13 · 2026-04-15 21:41:22

268

Views

Drawing a dfsa where L is a set of strings that contains at most 4 zeros

Published on 15 Apr 2026 - 21:41

score 576 · Answer 14 · 2026-05-10 14:07:29

576

Views

prove that your language is not regular by using the Pumping Lemma, $L = \{x \in \{0, 1\}^* | x = x^R \}$

Published on 10 May 2026 - 14:07

score 53 · Answer 15 · 2026-05-10 15:13:09

53

Views

Show that $R^{+} \equiv R \leftrightarrow L(RR) \subset L(R)$

Published on 10 May 2026 - 15:13

List Question

Necessary and Sufficient Conditions for x and A

Finding a regular expression for a given language

Understanding the second condition of the pumping lemma

How to draw a DFA from regular expression ab?

Prove that Language is not regular using pumping lemma

Show that $\{a^i b^j c^k \mid i>j>k>0\}$ is not a context free language by using pumping lemma

Proving equality of two regular languages using operations closed under regular languages

Use Pumping Lemma to show that $L_7$ is not context-free

proof that a language is a regular according to another language

How to use product automaton and intermediate state to prove existence of regular language?

Inductive Proof With Regular Expression

If RS is equivalent to SR, then RS is equivalent to SR (Proof by Contradiction)

Drawing a dfsa where L is a set of strings that contains at most 4 zeros

prove that your language is not regular by using the Pumping Lemma, $L = \{x \in \{0, 1\}^* | x = x^R \}$

Show that $R^{+} \equiv R \leftrightarrow L(RR) \subset L(R)$

Trending Questions

Popular # Hahtags

Popular Questions