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.2 - Page 806: 2


a. s0, s1, s2 b. 0, 1 c. s0 d. s2 e. Annotated next-state table

Work Step by Step

a. Find its states. --s0, s1, s2 b. Find its input symbols. --0,1 c. Find its initial state. --s0 d. Find its accepting states. --s2 e. Write its annotated next-state table. --Annotated next-state table
Small 1563080402
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.