Question

Necessary and Sufficient Conditions for x and A

score 62 · Answer 1 · 2018-10-08 14:42:12

62

Views

Necessary and Sufficient Conditions for x and A

Published on 08 Oct 2018 - 14:42

score 69 · Answer 2 · 2026-03-25 04:34:58

69

Views

Finding a regular expression for a given language

Published on 25 Mar 2026 - 4:34

score 103 · Answer 3 · 2018-10-21 18:56:27

103

Views

Understanding the second condition of the pumping lemma

Published on 21 Oct 2018 - 18:56

score 1.2k · Answer 4 · 2026-03-22 23:09:43

1.2k

Views

How to draw a DFA from regular expression ab?

Published on 22 Mar 2026 - 23:09

score 184 · Answer 5 · 2026-03-25 01:21:15

184

Views

Prove that Language is not regular using pumping lemma

Published on 25 Mar 2026 - 1:21

score 1.8k · Answer 6 · 2026-03-25 01:18:29

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 25 Mar 2026 - 1:18

score 380 · Answer 7 · 2018-10-28 23:11:10

380

Views

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

Published on 28 Oct 2018 - 23:11

score 1.5k · Answer 8 · 2026-03-25 03:07:51

1.5k

Views

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

Published on 25 Mar 2026 - 3:07

score 115 · Answer 9 · 2026-03-25 04:38:11

115

Views

proof that a language is a regular according to another language

Published on 25 Mar 2026 - 4:38

score 85 · Answer 10 · 2018-11-02 18:57:26

85

Views

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

Published on 02 Nov 2018 - 18:57

score 587 · Answer 11 · 2026-03-25 07:38:25

587

Views

Inductive Proof With Regular Expression

Published on 25 Mar 2026 - 7:38

score 2.2k · Answer 12 · 2026-03-25 06:07:14

2.2k

Views

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

Published on 25 Mar 2026 - 6:07

score 265 · Answer 13 · 2018-11-05 10:20:29

265

Views

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

Published on 05 Nov 2018 - 10:20

score 572 · Answer 14 · 2026-03-25 01:17:44

572

Views

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

Published on 25 Mar 2026 - 1:17

score 50 · Answer 15 · 2026-03-25 06:03:19

50

Views

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

Published on 25 Mar 2026 - 6:03

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