Give a context-free grammar for the following language over = {0, 1}: L={w : w is...

Question

Question

Give a context-free grammar for the following language over = {0, 1}:

L={w : w is not a palindrome}

Answer 1

Answer #1

Given Language is L={w : w is not a palindrome}

Context free grammar is :

A->0A0

A->1A1

A->0B1

A->1B0

B->0B |1B|ϵ

Here terminal are {0,1,ϵ}

variables are {A,B}

start symbol is A

Answer 2

Similar Homework Help Questions

Give a Context Free Grammar (CFG) for the following language: L = { w | the...

Give a Context Free Grammar (CFG) for the following language: L = { w | the number of a’s and the number of b’s in w are equal, ∑= {a, b} }
Give a context-free-grammar describing the syntax of the following language. Thank you =) Give a context-free-grammar...

Give a context-free-grammar describing the syntax of the following language. Thank you =) Give a context-free-grammar describing the syntax of the following language: L = { ww| we{a, b }" } is a context- free language, where w is a non-empty string from alphabet {a, b } and wt denotes the reversal of string w.
Give a context-free grammar generating the following language over Σ = {0, 1}: {0n1m : m,...

Give a context-free grammar generating the following language over Σ = {0, 1}: {0n1m : m, n ≥ 0; n ≠ m; n ≠ 2m}

Find the context free Grammar for the following language L = {w ∈ {a, b, c}*...

Find the context free Grammar for the following language L = {w ∈ {a, b, c}* : na (w) + nb (w) ≠ nc (w)}.
Give a context-free grammar for the following language: L1 = {ww^R c^n : w ∈ {a,...

Give a context-free grammar for the following language: L1 = {ww^R c^n : w ∈ {a, b}*, n >= 0}, i.e each string consists of a string w containing a’s and b’s, followed by the reverse of w, followed by 0 or more c’s.
Give a context free grammar for the language L where L = {a"bam I n>:O and...

Give a context free grammar for the language L where L = {a"bam I n>:O and there exists k>-o such that m=2"k+n) 3. Give a nondeterministic pushdown automata that recognizes the set of strings in L from question 3 above. Acceptance should be by accept state. 4. 5 Give a context-free grammar for the set (abc il j or j -k) ie, the set of strings of a's followed by b's followed by c's, such that there are either a...

Q6: (15 points) Give context-free grammar that generate the following language. a) abick ij,k 20 and...

Q6: (15 points) Give context-free grammar that generate the following language. a) abick ij,k 20 and i 2j +k} b) {w E 0,1' | the length of w is even, started by 1 and ended 01} Q6: (15 points) Give context-free grammar that generate the following language. a) abick ij,k 20 and i 2j +k} b) {w E 0,1' | the length of w is even, started by 1 and ended 01}
5. (5 points) Give context-free grammar that generate the following languages (1) (w is a binary...

5. (5 points) Give context-free grammar that generate the following languages (1) (w is a binary string, and w starts and ends with the same symbol (2) the empty language (empty set)
consider the language L = { a^m b^n : m>2n}, give context free grammar and Nondeteministc...

consider the language L = { a^m b^n : m>2n}, give context free grammar and Nondeteministc pUSH DOWN AUTOMATON

1. Find the context free grammer for L over Σ={a,b} L ={ a3n : n =>...

1. Find the context free grammer for L over Σ={a,b} L ={ a3n : n => 0 } 2. FInd the language L that is defined by the following grammar. (Use Set Builder Notation) S bS | Sb | a 3.Create a regular expression for the following: L(r)= {w {a,b}* : w begins with an 'a' and ends with a 'b' }