Answer
{λ,0} ∪ {$0^m1^n$ | m ≥ 1, n ≥ 1}
Work Step by Step
The language recognized by the given final state automation will be
-{λ,0} ∪ {$0^m1^n$ | m ≥ 1, n ≥ 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 877: 45
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.
