Explore BrainMass
Share

Automata and Computability

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

© BrainMass Inc. brainmass.com July 18, 2018, 8:28 pm ad1c9bdddf

Attachments

$2.19