Discrete Mathematics and Its Applications, Seventh Edition

Published by McGraw-Hill Education
ISBN 10: 0073383090
ISBN 13: 978-0-07338-309-5

Chapter 13 - Section 13.3 - Finite-State Machines with No Output - Exercises - Page 875: 7

Answer

$A ^∗ ⊆ B^∗$.

Work Step by Step

-A string is in$ A ^∗$ if and only if it is a concatenation of an arbitrary number of strings in A. -Because each string in A is also in B, it follows that a string in $A ^∗$ is also a concatenation of strings in B. Hence, $A ^∗ ⊆ B^∗$.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.