Let A = {hR,Si
Chapter , Problem 4.13(choose chapter or problem)
Let A = {hR,Si| R and S are regular expressions and L(R) L(S)}. Show that A is decidable.
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