The language consisting of strings of xs and ys in which the elements in every pair of
Chapter 12, Problem 27(choose chapter or problem)
In 25-27 find a regular expression that defines the given language.The language consisting of strings of x’s and y’s in which the elements in every pair of x’s are separated by at least one y.Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer