Question

Consider the regular expression ? = b(ba U aab)*(b U a*). In lexicographical order (shorter strings...

Consider the regular expression ? = b(ba U aab)*(b U a*). In lexicographical order (shorter strings before longer strings, alphabetical order for strings of the same length), give the 8 shortest strings in the language generated by ?.

Homework Answers

Answer #1

Solution:-

Using the Regular expression ? = b(ba U aab)*(b U a*) the 8 shortest strings which would be in the language generated by ? are as follows:-

1) 'b' it can be generated as b(epsilon)(epsilon)
2) 'ba' it can be generated as b(epsilon)(a)
3) 'bb' it can be generated as b(epsilon)(b)
4) 'baa' it can be generated as b(epsilon)(aa)
5) 'bba' it can be generated as b(ba)(epsilon)
6) 'baaa' it can be generated as b(epsilon)(aaa)
7) 'baab' it can be generated as b(aab)(epsilon)
8) 'bbaa' it can be generated as b(ba)(a)

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Find a regular expression to describe: The set of all strings over the alphabet {a, b,...
Find a regular expression to describe: The set of all strings over the alphabet {a, b, c, d} that contain exactly one a and exactly one b So, for example, the following strings are in this language: ab, ba, cccbad, acbd, cabddddd, ddbdddacccc and the following strings are NOT in this language: a, ccbc, acbcaaacba, acacac, bcbbbbbca, aca, c, d, b
For each of the following regular expressions, give 2 examples of strings that are in the...
For each of the following regular expressions, give 2 examples of strings that are in the language described by the regular expression, and 2 examples of strings that are not in that language. In all cases the alphabet is {a,b}. ab*ba* (a ∪ ε)b* (a ∪ b)ε*(aa ∪ bb)
Give a regular expression for the set of strings over {a, b, c} such that the...
Give a regular expression for the set of strings over {a, b, c} such that the sum of the number of a’s and the number of b’s is equal to 3.
Write the regular expression for the following sets (4.5) 4.1 All strings over {a,b} that are...
Write the regular expression for the following sets (4.5) 4.1 All strings over {a,b} that are odd in length 4.2 All strings over {a,b} whose length is not a multiple of 3 4.3 All strings over a,b that start with aa and end with bb
Give a regular expression for the set of all strings on the alphabet {0,1} with no...
Give a regular expression for the set of all strings on the alphabet {0,1} with no runs of length greater than 3(for example, no substrings 0^i or 1^i with i > 3)
Problem 5 Regular Expressions. a) Define a regular expression for all strings of odd length, over...
Problem 5 Regular Expressions. a) Define a regular expression for all strings of odd length, over the alphabet of {0}. b) Define a regular expression for identifiers over the alphabet of {A,B,C,a,b,c,0,1,2,3,4,5,6,7,8,9}, such that an identifier must begin with an alphabetic character and must contain at least one numeric character. c) Try to modify the definition above so that identifiers still begin with an alphabetic character, but after that, it must contain at least one numeric, at least one lower-case...
Automata Theory and Formal Languages Problems 1: Consider the following two grammars. Grammar G1- S →...
Automata Theory and Formal Languages Problems 1: Consider the following two grammars. Grammar G1- S → aSb / ∈ Grammar G2- S → aAb / ∈, A → aAb / ∈ a. is G1=G2 b. What is the grammar generated by the expression Problem 2: Let us consider the grammar. G2 = ({S, A}, {a, b}, S, {S → aAb, aA → aaAb, A → ε } ) Derive aaabbb Problem 3: Suppose we have the following grammar. G: N...
1.2 Which of the following statements is wrong?        a). A set is a subset of itself...
1.2 Which of the following statements is wrong?        a). A set is a subset of itself        b). Emptyset is a subset of any set        c). A set is a subset of its powerset        d). The cardinality of emptyset is 0 1.3. Which of the following statements is correct?        a). A string is a set of symbols from an alphabet        b). The length of the concatenation of two strings can           be the same as one of them        c). The length of...
Consider the following Boolean expression (a + b) . (a + c). Provide a simpler expression...
Consider the following Boolean expression (a + b) . (a + c). Provide a simpler expression (fewer gates) that is equivalent. Show that your expression is equivalent by building truth tables for both expressions in the same way as we've done before. 1a. Imagine that you have designed a circuit that uses N expressions of the form (a + b) . (a + c). We replace each of these with your solution to question 1. How many fewer transistors will...
Consider the NFA N with states labeled q1, q2 and q3, where q1 is the start...
Consider the NFA N with states labeled q1, q2 and q3, where q1 is the start state and q2 and q3 are the final (accepting) states. The transition function for N is δ(q1,a) = {q1}, δ(q1,b) = {q1,q2},  δ(q2,a) = {q3}, δ(q2,b)= ∅, δ(q3,a)= ∅, and δ(q3,b)= ∅. Let L be the language recognized by N i.e. L(N). a) Draw the state diagram for N. b) Describe in plain English what's in the language L. c) Via the construction NFA to...