Question

L = {www| w belongs to {0,1}*} prove via pumping lemma

score 230 · Answer 1 · 2015-06-13 20:04:20

230

Views

L = {www| w belongs to {0,1}*} prove via pumping lemma

Published on 13 June 2015 at 20:04

score 362 · Answer 2 · 2016-12-28 14:05:27

362

Views

Is this a context free or context sensitive language?

Published on 28 December 2016 at 14:05

score 849 · Answer 3 · 2014-11-18 16:21:14

849

Views

How to create a context-free grammar?

Published on 18 November 2014 at 16:21

score 638 · Answer 4 · 2017-09-03 09:38:39

638

Views

1 or 2 right hand side variable in Context free language

Published on 03 September 2017 at 09:38

score 38 · Answer 5 · 2014-12-10 14:38:29

38

Views

context-free matching of characters

Published on 10 December 2014 at 14:38

score 13 · Answer 6 · 2023-10-17 00:10:55

13

Views

Why pumping lemma for context free languages do not have bound on first part of string?

Published on 17 October 2023 at 00:10

score 44 · Answer 7 · 2023-11-12 23:38:44

44

Views

NLTK tell if word is generated by CFG

Published on 12 November 2023 at 23:38

score 1k · Answer 8 · 2020-12-05 20:24:23

1k

Views

Implementation of a context-free grammar for logical operators with parentheses

Published on 05 December 2020 at 20:24

score 812 · Answer 9 · 2022-04-08 18:00:32

812

Views

CFG for a = b and c = d (length)

Published on 08 April 2022 at 18:00

score 228 · Answer 10 · 2022-04-25 08:16:53

228

Views

In Context Free Grammer, do we replace all variable during a substitution? or can we apply substitution rule to only of the variable of same type?

Published on 25 April 2022 at 08:16

score 595 · Answer 11 · 2022-04-28 07:57:51

595

Views

CFG for L = {a^mb^nc^k: k = m×n}

Published on 28 April 2022 at 07:57

score 106 · Answer 12 · 2021-04-23 14:10:42

106

Views

bounded PDA and context-free languages

Published on 23 April 2021 at 14:10

score 967 · Answer 13 · 2018-11-09 02:30:25

967

Views

Describe the language generated by this context-free grammar

Published on 09 November 2018 at 02:30

score 15.9k · Answer 14 · 2018-11-10 23:28:13

15.9k

Views

Context-free grammar for the language L = {a^(n)b^(m)c^(k): m = |i - k|}

Published on 10 November 2018 at 23:28

score 179 · Answer 15 · 2020-08-31 19:51:39

179

Views

What makes this example a context-free language rather than regular language?

Published on 31 August 2020 at 19:51

score 8.2k · Answer 16 · 2014-01-19 08:33:13

8.2k

Views

Union of two (irregular) Context Free Language results a Regular Language?

Published on 19 January 2014 at 08:33

score 3k · Answer 17 · 2014-01-22 14:38:35

3k

Views

The complement of the language L={a^n b^n | n !=100}

Published on 22 January 2014 at 14:38

score 7.1k · Answer 18 · 2014-01-29 06:37:30

7.1k

Views

concatenation & union - regular and context free languages

Published on 29 January 2014 at 06:37

score 1.1k · Answer 19 · 2016-02-13 06:32:50

1.1k

Views

Proving language is context-free with pumping lemma

Published on 13 February 2016 at 06:32

score 100 · Answer 20 · 2023-01-01 11:09:47

100

Views

Is there any way to count the production of specific rules in order in a context free grammar?

Published on 01 January 2023 at 11:09

List Question

L = {www| w belongs to {0,1}*} prove via pumping lemma

Is this a context free or context sensitive language?

How to create a context-free grammar?

1 or 2 right hand side variable in Context free language

context-free matching of characters

Why pumping lemma for context free languages do not have bound on first part of string?

NLTK tell if word is generated by CFG

Implementation of a context-free grammar for logical operators with parentheses

CFG for a = b and c = d (length)

In Context Free Grammer, do we replace all variable during a substitution? or can we apply substitution rule to only of the variable of same type?

CFG for L = {a^mb^nc^k: k = m×n}

bounded PDA and context-free languages

Describe the language generated by this context-free grammar

Context-free grammar for the language L = {a^(n)b^(m)c^(k): m = |i - k|}

What makes this example a context-free language rather than regular language?

Union of two (irregular) Context Free Language results a Regular Language?

The complement of the language L={a^n b^n | n !=100}

concatenation & union - regular and context free languages

Proving language is context-free with pumping lemma

Is there any way to count the production of specific rules in order in a context free grammar?

Trending Questions

Popular # Hahtags

Popular Questions