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

Answer

a. (a + b) · (c + d) b. Partial answer: 11∗ = 1·1 = 1, 12∗ = 1·2 = 2, 21/ = 2/1 = 2

Work Step by Step

a. If the expression ab + cd + · in postfix notation is converted to infix notation, what is the result . Let $E = {1, 2,*, /}$ and let L be the set of all strings over $E obtained by writing first a number (1 or 2), then a second number (1 or 2), which can be the same as the first one, and finally an operation (* or / where * indicates multiplication and / indicates division). Then L is a set of postfix, or reverse Polish, expressions. List all the elements of L between braces, and evaluate the resulting expressions. ---a. (a + b) · (c + d) b. Partial answer: 11∗ = 1·1 = 1, 12∗ = 1·2 = 2, 21/ = 2/1 = 2
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.