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...
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
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)
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?
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 F be a σ-algebra. Show that if A and B are in F, then A...
Let F be a σ-algebra. Show that if A and B are in F, then A ∪ B ∈ F and A ∩ B ∈ F.
Let A be the set of all strings of decimal digits of length five. For example...
Let A be the set of all strings of decimal digits of length five. For example 00312 and 19483 are strings in A. a. How many strings in A begin with 774? b. How many strings in A have exactly one 8? c. How many strings in A have exactly three 6’s? d. How many strings in A have the digits in a strictly increasing order? For example 02357 and 14567 are such strings, but 31482 and 12335 are not.
Let X be a set and let F1,F2 ⊆ P(X) be two σ-algebras on X. Let...
Let X be a set and let F1,F2 ⊆ P(X) be two σ-algebras on X. Let G := {A ∩ B | A ∈ F1, B ∈ F2}. Prove the following statements: (1) G is closed under finite intersections. (2) σ(G) = σ(F1 ∪ F2).
Define a grammar by setting Σ = {σ} and let F consist of the following instruction...
Define a grammar by setting Σ = {σ} and let F consist of the following instruction formulas. 1.    σ → N V.2.    N → n, for some n  {he, she, José, Sal, Anna}.3.    V → v, for some v  {runs, jumps, skips, falls, swims}.4.    σ → σ P σ.5.    P → p, for some p  {and, while until}.6.    σ → either σ or σ. Consider the following string in the given grammar. Draw the corresponding tree. (Submit a file with a maximum size of 10MB.) Sal runs while Anna...