Share
Explore BrainMass

Automata and Computability

Let A = (attached) R and S are regular expressions and L(R)  L(S) . Show that A is decidable.

Attachments

$2.19