Provide CFG for the following languages. 4.1.1 f) { 0^2 1^2n | n>=1} 4.1.2 h) The...

Question

Question

Provide CFG for the following languages.

4.1.1 f) { 0^2 1^2n | n>=1}

4.1.2 h) The set of the strings of the form w1^n, where w is the string of 0’s and 1’s of length n.

engineering Computer-Science

Answer 1

Answer #1

4.1.2h)

Answer 2

Similar Homework Help Questions

Exercise 4.1.1: Prove that the following are not regular languages a) (0"1n|n 2 1). This language,...

Exercise 4.1.1: Prove that the following are not regular languages a) (0"1n|n 2 1). This language, consisting of a string of 0's followed by an cqual-length string of 1's, is the language Loi we considered informally at the beginning of the scction. Here, you should apply the pumping lemma in the proof. b) The set of strings of balanced parentheses. These are the strings of char- acters "(" and " that can appear in a well-formed arithmetic expression *c) O"IO"...
Build PDA to generate all strings of the form 0 (n) 1 (2n+3) where n>=0 Build...

Build PDA to generate all strings of the form 0 (n) 1 (2n+3) where n>=0 Build CFG to generate all strings of the form 0 (n) 1 (2n+3) where n>=0
2. Give a CFG for each of the following languages where m, n, k, l ≥...

2. Give a CFG for each of the following languages where m, n, k, l ≥ 0. (a) L = {am bn ck dl | m = n + k + l}. (b) L = {am bn ck dl | k = m + n + l}. (c) L = {am bn ck dl | m + 2l = n + k}. (d) L = {am bn ck dl | m + k = 2n + l}.

Prove that the following are not regular languages. Just B and F please Prove that the...

Prove that the following are not regular languages. Just B and F please Prove that the following are not regular languages. {0^n1^n | n Greaterthanorequalto 1}. This language, consisting of a string of 0's followed by an equal-length string of l's, is the language L_01 we considered informally at the beginning of the section. Here, you should apply the pumping lemma in the proof. The set of strings of balanced parentheses. These are the strings of characters "(" and ")"...
Design Turing machines for the following languages: a. The set of all strings with an equal...

Design Turing machines for the following languages: a. The set of all strings with an equal number of 0’s and 1’s. b. {an bn cn | n >= 1} c. {wwR | w is any string of 0’s and 1’s}
Problem 1 Create a CFG that generates each of the languages below. [10 points] [10 points]...

Problem 1 Create a CFG that generates each of the languages below. [10 points] [10 points] wR is a substring of r if there are strings y, z E {a, b)" such that r = ywR2. A = {w I w E {a, b)" has more as than bs} B = {w#r l w,xe(a, b)" and wR a. b. is a substring of r). Rememb er, c. [10 points] C = {amb"ck 1 m, n > 0 and k =...

2. A binary string is a finite sequence u-діаг . . . an, where each ai is either 0 or 1. In this case n is the length o...

2. A binary string is a finite sequence u-діаг . . . an, where each ai is either 0 or 1. In this case n is the length of the string v. The strings ai, aia2,... ,ai... an-1,ai... an are all prefixes of v. On the set X of all binary strings consider the relations Ri and R2 defined as follows: Ri-(w, v) w and v have the same length ) R2 = {(u, v) I w is a prefix...
2. A binary string is a finite sequence v = a1a2 . . . an, where each ai is either 0 or 1. In this case n is the length...

2. A binary string is a finite sequence v = a1a2 . . . an, where each ai is either 0 or 1. In this case n is the length of the string v. The strings a1, a1a2, . . . , a1 . . . an−1, a1 . . . an are all prefixes of v. On the set X of all binary strings consider the relations R1 and R2 defined as follows: R1 = {(w, v) | w...
Theory of Computation - Push Down Automata (PDA) and Context Free Grammars (CFG) Problem 1. From...

Theory of Computation - Push Down Automata (PDA) and Context Free Grammars (CFG) Problem 1. From a language description to a PDA Show state diagrams of PDAs for the following languages: a. The set of strings over the alphabet fa, b) with twice as many a's as b's. Hint: in class, we showed a PDA when the number of as is the same as the number of bs, based on the idea of a counter. + Can we use a...

Please build a CFG for a formal language with strings of the form 1^n0^(n+2)

Please build a CFG for a formal language with strings of the form 1^n0^(n+2)