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

Question

Question

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

L ={ a³ⁿ : n => 0 }

2. FInd the language L that is defined by the following grammar. (Use Set Builder Notation)
S $\rightarrow$ bS | Sb | a

3.Create a regular expression for the following:

L(r)= {w $\epsilon$ {a,b}* : w begins with an 'a' and ends with a 'b' }

engineering Computer-Science

Answer 1

Answer #1

for example Cl,b

Answer 2

Similar Homework Help Questions

give context free grammer for this language 1. 35 Points] Give context-free grammars for the following...

give context free grammer for this language 1. 35 Points] Give context-free grammars for the following languages: (c) wEfa, b, c}* : |w = 5na(w) +2n(w)}
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...
indicate what language is generated by the context-free grammar. The alphabet is Σ = {a, b}...

indicate what language is generated by the context-free grammar. The alphabet is Σ = {a, b} • S → SaS | bS

Automata Theory Give a context-free grammar producing the following language over Σ = {0, 1}: {w...

Automata Theory Give a context-free grammar producing the following language over Σ = {0, 1}: {w : every odd position of w is 1 and w = wR} (HINT: All strings in the language will be of odd length).
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 over = {0, 1}: L={w : w is...

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

Q1: Given the below language and context free gramma:, a. Show that the grammar is ambiguous...

Q1: Given the below language and context free gramma:, a. Show that the grammar is ambiguous using the string ( abc) by using substitutions. b. Then design a push down automata that recognizes the language. C. Then show the tracing of (abc, abbccc) using the push down automata. d. Then Show which two simple languages create the greaterlanguage. Give set builder notation for each language. e. Then produce Chomsky normal form for the grammar. The following context-free language is inherently...
1. Give a context-free grammar for the set BAL of balanced strings of delimiters of three...

1. Give a context-free grammar for the set BAL of balanced strings of delimiters of three types (), and . For example, (OOis in BAL but [) is not. Give a nondeterministic pushdown automata that recognizes the set of strings in BAL as defined in problem 1 above. Acceptance should be by accept state. 2. Give a context free grammar for the language L where L-(a"b'am I n>-o and there exists k>-o such that m-2*ktn) 3. Give a nondeterministic pushdown...
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}

Give a context-free grammar generating the complement of the language {anbn : n ≥ 0} over...

Give a context-free grammar generating the complement of the language {anbn : n ≥ 0} over Σ = {a, b}