1. Find a grammar for L(G) = {All bit strings with twice as many 1s as...

Question

Question

1. Find a grammar for L(G) = {All bit strings with twice as many 1s as 0s}.

2. Find a grammar for L(G) = {w | | w | is odd, ∑ = (0,1)}.

3. Find a grammar for the odd palindromes over {a, b, c}.

engineering Computer-Science

Answer 1

Answer #1

Answer 2

Similar Homework Help Questions

Consider all bit strings of length 12 How many have 8 0s and 4 1s that have exactly 3 consecutive...

consider all bit strings of length 12 How many have 8 0s and 4 1s that have exactly 3 consecutive 1s (allow 4 consecutive 1s)? A 90 В 72 С 45 D 36 E 9 consider all bit strings of length 12 How many have 8 0s and 4 1s that have exactly 3 consecutive 1s (allow 4 consecutive 1s)? A 90 В 72 С 45 D 36 E 9
How many bit strings of length 10 have... (a) Exactly four 1s in a row? (b)...

How many bit strings of length 10 have... (a) Exactly four 1s in a row? (b) at least eight 0s in a row?
Let A be the set of all bit strings of length 10. 1. How many bit...

Let A be the set of all bit strings of length 10. 1. How many bit strings of length 10 are there? How many bit strings of length 10 begin with 1101? How many bit strings of length 10 have exactly six 0's? How many bit strings of length 10 have equal numbers of O's and 1's? How many bit strings of length 10 have more O's than 1's? a. b. c. d. e.

1. Use a Regular Expression to define the set of all bit strings of one or...

1. Use a Regular Expression to define the set of all bit strings of one or more 0's followed by only a 1. 2. Use a Regular Expression to define the set of all bit string of two or more symbols followed by three or more 0's. 3. Are these two grammars the same? a. S-> aSb|ab|λ b. S-> aAb|ab A->aAb|λ 4. Use the process of elimination to find the language of the following FA: (see picture for diagram) 5....
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...
1. Let £ = {0,1} and consider the language L of all binary strings of odd...

1. Let £ = {0,1} and consider the language L of all binary strings of odd length with a 0 in the middle. Give a Turing machine that decide L.

1. Write DFA, NFA (small), regular expression and right linear grammar for strings over {a,b} a. ...

1. Write DFA, NFA (small), regular expression and right linear grammar for strings over {a,b} a. End in either aa or bb b. ( an | bna) n >= 0 c. {w : w such that w contains the substring “bb” or w contains an odd number of a’s (or both). d. {w : w does not contain exactly two a’s} e. { w : w starts with substring abb and contains substring bba}
CFG questions 1. True or false? Given G: S → aSbSÍ bSaS | λ, L(G) =...

CFG questions 1. True or false? Given G: S → aSbSÍ bSaS | λ, L(G) = EQUAL. 2. Provide a grammar for all words that are not palindromes. 3. Provide a grammar for L = { a,b' : is js 2 4. Provide a grammar for L = { aibak: i + j = k }. 5. Provide a grammar for L = { aba: i + k = j).
1. Who are language descriptions intended for? Consider the following grammar: ab b | b a...

1. Who are language descriptions intended for? Consider the following grammar: ab b | b a | a Which of the following sentences are in the language generated by this grammar? (DONE) a) baab ==> YES b) bbbab ==> NO c) bbaaaaaS ==> NO d) bbaab ==> YES 2. Write a BNF grammar for the language consisting of binary strings (any combination of 0s and 1s) of at least 2 digits.

Problem 3 (Counting binary strings) 20 marks/ Consider all bit strings of length 15. 1. How many ...

Problem 3 (Counting binary strings) 20 marks/ Consider all bit strings of length 15. 1. How many begin with 00? 2. How many begin with 00 and end with 11? 3. How many begin with 00 or end with 10? 4. How many have exactly ten 1's? 5. How many have exactly ten 1's such as none of these 1's are adjacent to each other? Provide detailed justifications for your answers. Problem 3 (Counting binary strings) 20 marks/ Consider all...