Discrete Mathematics with Applications 4th Edition

Published by Cengage Learning
ISBN 10: 0-49539-132-8
ISBN 13: 978-0-49539-132-6

Chapter 12 - Regular Expressions and Finite-State Automata - Exercise Set 12.1 - Page 790: 16

Answer

--$0101$, -$1$, --$01$, --$10000,$ --$ 011100$

Work Step by Step

Here are five strings that belongs to $0∗1(0∗1∗)∗$ out of infinitely many: --$0101$, -$1$, --$01$, --$10000,$ and --$ 011100$
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.