Consider the language L over alphabets (a, b) that produces strings of the form aa* (a...

Consider the language L over alphabets (a, b) that produces strings of the form aa* (a + b) b*a.
a) Construct a nondeterministic finite automata (NFA) for the language L given above.

b) Construct a deterministic finite automaton (DFA) for the NFA you have constructed above.

Expert Solution

venereology answered 6 months ago

Prove the language of strings over {a, b} of the form (b^m)(a^n) , 0 ≤ m...

Prove the language of strings over {a, b} of the form (b^m)(a^n) , 0 ≤ m < n-2 isn’t regular. (I'm using the ^ notation but your free to make yours bman instead of (b^m)(a^n) ) Use the pumping lemma for regular languages.

Write a regular expression for the language of all strings over {a,b} in which every b...

Write a regular expression for the language of all strings over {a,b} in which every b is directly preceded by a, and may not be directly followed by more than two consecutive a symbols.

1. Prove the language L is not regular, over the alphabet Σ = {a, b}. L...

1. Prove the language L is not regular, over the alphabet Σ = {a, b}. L = { aib2i : i > 0} 2) Prove the language M is not regular, over the alphabet Σ = {a, b}. M = { wwR : w is an element of Σ* i.e. w is any string, and wR means the string w written in reverse}. In other words, language M is even-length palindromes.

S is the language over S = {a, b, c, d, e} containing all strings that...

S is the language over S = {a, b, c, d, e} containing all strings that start with at least 2 a's, followed by any number of b's, followed by 5 c's, followed by an odd number of d's, followed by an even number of e's. For example, S contains aaabbcccccdee, aaaacccccdddeeee, and so on. Write S symbolically in the manner of section 6.1, problem # 12 a) - f). Example 6.12 will also be helpful. bonus: How many strings in {000, 11}*...

4. Consider bit strings with length l and weight k (so strings of l 0’s and...

4. Consider bit strings with length l and weight k (so strings of l 0’s and 1’s, including k 1’s). We know how to count the number of these for a ﬁxed l and k. Now, we will count the number of strings for which the sum of the length and the weight is ﬁxed. For example, let’s count all the bit strings for which l + k = 11. (a) Find examples of these strings of diﬀerent lengths. What...

Question II: Consider the language L below. If L is a regular language, construct the corresponding...

Question II: Consider the language L below. If L is a regular language, construct the corresponding DFA. If not, prove that L is not a regular language. L= {0n10n | n ≥1} Consider the language M consisting of those strings of 0’s and 1’s that have an equal number of 0’s and 1’s (not in any particular order). Suppose we know M is not a regular language. Consider the language N consisting of those strings of 0’s and 1’s that...

Exercise 10.11.1: Counting strings over {a, b, c}. infoAbout Count the number of strings of length...

Exercise 10.11.1: Counting strings over {a, b, c}. infoAbout Count the number of strings of length 9 over the alphabet {a, b, c} subject to each of the following restrictions. (a) The first or the last character is a. (b) The string contains at least 8 consecutive a's. (c) The string contains at least 8 consecutive identical characters. (d) The first character is the same as the last character, or the last character is a, or the first character is...

Draw PDA transition diagram for the following language: The set of strings over the alphabet {x,...

Draw PDA transition diagram for the following language: The set of strings over the alphabet {x, y} where 2 * (# of x's) = 3 * (#y's) That is, if we let nx be the number of x's and ny be the number of y's, then the strings in these language are those where 2nx = 3ny Try to find a PDA that is as simple and elegant as possible (do not convert from CFG). ------------------------------------------------------------------------------------------------------------------ USE Notation between transition:...

Construct a PDA that matches all strings in the language over {x,y} such that each string...

Construct a PDA that matches all strings in the language over {x,y} such that each string has at least twice as many y's as x's. Below, give a short description of the set of strings associated with each state of your PDA.

1. Consider the regular grammar G given below: S → aS|aA|bB|λ A → aA|bS B →...

1. Consider the regular grammar G given below: S → aS|aA|bB|λ A → aA|bS B → bB|aS (a) Give a derivation for the strings aabbba and baaba (b) Give an infinite language L such that L is not a subset of L(G) (c) Give a regular expression that describes the language L(G).

Question