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 789: 1

Answer

a. L1 = {, x, y, xx, yy, xxx, xyx, yxy, yyy, xxxx,xyyx, yxxy, yyyy} b. L2 = {x, xx, xy, xxx, xxy, xyx, xyy}

Work Step by Step

E= {x, y} be an alphabet a. Let L1 be the language consisting of all strings over that are palindromes and have length ≤ 4. List the elements of L1 between braces. b. Let L2 be the language consisting of all strings over that begin with an x and have length ≤ 3. List the elements of L2. --- a. L1 = {, x, y, xx, yy, xxx, xyx, yxy, yyy, xxxx,xyyx, yxxy, yyyy} b. L2 = {x, xx, xy, xxx, xxy, xyx, xyy}
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.