Question

Prove that this language is regular or not

score 146 · Answer 1 · 2026-04-14 18:17:37

146

Views

Prove that this language is regular or not

Published on 14 Apr 2026 - 18:17

score 728 · Answer 2 · 2026-04-18 03:03:42

728

Views

Proving a language is not context-free (pumping lemma)

Published on 18 Apr 2026 - 3:03

score 57 · Answer 3 · 2026-04-15 02:56:24

57

Views

Pumping lemma to prove the set of all words such that the sum of the number of 0s and 1s occurring in it is an even number is not regular

Published on 15 Apr 2026 - 2:56

score 135 · Answer 4 · 2026-04-14 02:31:47

135

Views

Using pumping lemma to prove a set of substrings cannot be expressed as a regular expression...

Published on 14 Apr 2026 - 2:31

score 32 · Answer 5 · 2026-04-09 15:59:21

32

Views

Is it possible to build a context-free grammar for the following language?

Published on 09 Apr 2026 - 15:59

score 660 · Answer 6 · 2026-04-09 18:56:12

660

Views

An example of context free language and pumping lemma.

Published on 09 Apr 2026 - 18:56

score 409 · Answer 7 · 2026-04-10 22:41:56

409

Views

Prove that the language is not regular using pumping lemma

Published on 10 Apr 2026 - 22:41

score 531 · Answer 8 · 2026-04-11 06:11:43

531

Views

Prove that a language is not regular using the pumping lemma

Published on 11 Apr 2026 - 6:11

score 986 · Answer 9 · 2026-04-11 23:06:17

986

Views

Prove that $ L = { \{\ a^{i^{2}} : i \in N \ \cup \{0\} \ \}} $ is not regular using pumping lemma

Published on 11 Apr 2026 - 23:06

score 42 · Answer 10 · 2026-04-11 17:42:09

42

Views

Proving that a certain language is or is not regular using pumping lemma

Published on 11 Apr 2026 - 17:42

score 191 · Answer 11 · 2026-04-14 17:40:55

191

Views

Proving regularity with pumping lemma

Published on 14 Apr 2026 - 17:40

score 46 · Answer 12 · 2026-04-11 09:10:06

46

Views

Determining if langauge is regular using pumping lemma

Published on 11 Apr 2026 - 9:10

score 666 · Answer 13 · 2026-04-07 16:12:12

666

Views

Show a language is not regular by using the pumping lemma

Published on 07 Apr 2026 - 16:12

score 12.1k · Answer 14 · 2026-04-14 03:57:55

12.1k

Views

Use Pumping Lemma to prove that the language with strings of the same number of 0 and 1 is not regular

Published on 14 Apr 2026 - 3:57

score 226 · Answer 15 · 2026-04-13 13:21:58

226

Views

Prove that language is not context free

Published on 13 Apr 2026 - 13:21

List Question

Prove that this language is regular or not

Proving a language is not context-free (pumping lemma)

Pumping lemma to prove the set of all words such that the sum of the number of 0s and 1s occurring in it is an even number is not regular

Using pumping lemma to prove a set of substrings cannot be expressed as a regular expression...

Is it possible to build a context-free grammar for the following language?

An example of context free language and pumping lemma.

Prove that the language is not regular using pumping lemma

Prove that a language is not regular using the pumping lemma

Prove that $ L = { \{\ a^{i^{2}} : i \in N \ \cup \{0\} \ \}} $ is not regular using pumping lemma

Proving that a certain language is or is not regular using pumping lemma

Proving regularity with pumping lemma

Determining if langauge is regular using pumping lemma

Show a language is not regular by using the pumping lemma

Use Pumping Lemma to prove that the language with strings of the same number of 0 and 1 is not regular

Prove that language is not context free

Trending Questions

Popular # Hahtags

Popular Questions