Answer
Folowing the given State diagram for driving the language
Work Step by Step
language recognised by the given finite state-automation will be following
{λ}∪{0}{1} ∗ {0}∪{10,11}{0, 1} ∗ ∪{0}{1} ∗ {01}{0, 1}∗ ∪ {0}{1}∗{00}{0}∗{1}{0, 1}∗
Discrete Mathematics and Its Applications, Seventh Edition
by Rosen, Kenneth
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 876: 21
Update this answer!
You can help us out by revising, improving and updating this answer.
Update this answerAfter 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.
