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


aaaba is in the language but baabb is not a language

Work Step by Step

in the Expression: (b | E)a(a | b)∗a(b | E), strings: aaaba, baabb aaaba is in the language but baabb is not because if a string in the language contains a b to the right of the leftmost a, then it must contain another a to the right of the all b’s.
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.