Question

Let  Σ = { a, b }. Which of the following strings cannot be represented by the...

Let  Σ = { a, b }.

Which of the following strings cannot be represented by the RE

a* b* (ba)* a*?

Homework Answers

Answer #1

A REGULAR EXPRESSION also called as RATIONAL EXPRESSION is a sequence of characters that define a search pattern.Search pattern can be anything :-

  • a simple character,
  • a fixed string or
  • complex expression containing special characters describing the pattern

The strings(literals) that cannot be represented by the RE a* b* (ba)* a* :-

All the strings that can be generated till length-2 are definitely present in this language.

However, strings of length-3; {aaa, aab, aba, abb, baa, bab, bba, bbb} . String “bab” cannot be generated from given language. So, the string “bab” is the string not represented by given regular expression.

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
Please answer True or False on the following: 1. Let L be a set of strings...
Please answer True or False on the following: 1. Let L be a set of strings over the alphabet Σ = { a, b }. If L is infinite, then L* must be infinite (L* is the Kleene closure of L) 2. Let L be a set of strings over the alphabet Σ = { a, b }. Let ! L denote the complement of L. If L is finite, then ! L must be infinite. 3. Let L be...
Let s and p be two particular strings over an alphabet Σ. Prove that the following...
Let s and p be two particular strings over an alphabet Σ. Prove that the following language M = {w ∈ Σ ∗ | w contains u as a substring but does not contain v as a substring} is regular. plz provide DFA and also simplified the DFA thx !
Write a formal grammar that generates all strings of odd length over Σ = {a, b}.
Write a formal grammar that generates all strings of odd length over Σ = {a, b}.
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
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 ?.
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)
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)
a. Draw a DFA for the language of all strings over Σ = {?, ?} that...
a. Draw a DFA for the language of all strings over Σ = {?, ?} that do not have two consecutive ?’s. b. Define the transition function, ?, for the DFA in the previous question.
Let R be a relation on a set of integers, which is represented by: a R...
Let R be a relation on a set of integers, which is represented by: a R b if and only if a = 2 ^ k.b, for some integer k. Check if the relation R is an equivalent relation!
Let letters A,B,C,D,E,F,G be used to form strings of length 4. How many strings of length...
Let letters A,B,C,D,E,F,G be used to form strings of length 4. How many strings of length 4 with repetitions contain A and B. How about without repetitions?
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT