Question

Prove that this language is regular or not

score 143 · Answer 1 · 2016-10-17 21:07:09

143

Views

Prove that this language is regular or not

Published on 17 Oct 2016 - 21:07

score 723 · Answer 2 · 2016-10-28 07:39:26

723

Views

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

Published on 28 Oct 2016 - 7:39

score 54 · Answer 3 · 2016-11-03 20:10:33

54

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 03 Nov 2016 - 20:10

score 132 · Answer 4 · 2016-11-05 19:20:13

132

Views

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

Published on 05 Nov 2016 - 19:20

score 29 · Answer 5 · 2016-11-08 09:16:15

29

Views

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

Published on 08 Nov 2016 - 9:16

score 657 · Answer 6 · 2016-11-26 15:43:55

657

Views

An example of context free language and pumping lemma.

Published on 26 Nov 2016 - 15:43

score 406 · Answer 7 · 2016-12-23 09:45:59

406

Views

Prove that the language is not regular using pumping lemma

Published on 23 Dec 2016 - 9:45

score 528 · Answer 8 · 2016-12-23 15:55:37

528

Views

Prove that a language is not regular using the pumping lemma

Published on 23 Dec 2016 - 15:55

score 983 · Answer 9 · 2016-12-24 22:07:21

983

Views

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

Published on 24 Dec 2016 - 22:07

score 39 · Answer 10 · 2016-12-25 12:57:16

39

Views

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

Published on 25 Dec 2016 - 12:57

score 188 · Answer 11 · 2016-12-25 15:34:32

188

Views

Proving regularity with pumping lemma

Published on 25 Dec 2016 - 15:34

score 44 · Answer 12 · 2016-12-30 14:07:10

44

Views

Determining if langauge is regular using pumping lemma

Published on 30 Dec 2016 - 14:07

score 664 · Answer 13 · 2017-02-16 07:53:52

664

Views

Show a language is not regular by using the pumping lemma

Published on 16 Feb 2017 - 7:53

score 12.1k · Answer 14 · 2017-03-20 22:25:27

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 20 Mar 2017 - 22:25

score 223 · Answer 15 · 2017-04-02 11:18:47

223

Views

Prove that language is not context free

Published on 02 Apr 2017 - 11:18

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