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

Answer

three a’s and end in an a.

Work Step by Step

The language $b∗ab∗ab∗a$ consists of all strings of a’s and b’s that contain exactly three a’s and end in an a.
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.