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: 5

Answer

a) The set of strings consisting of zero or more consecutive bit pairs 10 b) The set of strings consisting of all 1s such that the number of 1s is divisible by 3, including the null string c) The set of strings in which every 1 is immediately preceded by a 0 d) The set of strings that begin and end with a 1 and have at least two 1s between every pair of 0s

Work Step by Step

Describing Elements of set $A^*$ for the given values of A a){10}= The set of strings consisting of zero or more consecutive bit pairs 10 b){111}= The set of strings consisting of all 1s such that the number of 1s is divisible by 3, including the null string c) {0,01}= The set of strings in which every 1 is immediately preceded by a 0 d){1,101}= The set of strings that begin and end with a 1 and have at least two 1s between every pair of 0s
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.