Discrete Mathematics With Applications
5th Edition
ISBN: 9781337694193
Author: EPP, Susanna S.
Publisher: Cengage Learning,
expand_more
expand_more
format_list_bulleted
Videos
Question
Chapter 12.1, Problem 25ES
To determine
Find a regular expression that defines the given language.
The language consisting of all strings of
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
a) Suppose that we are carrying out the 1-phase simplex algorithm on a linear program in
standard inequality form (with 3 variables and 4 constraints) and suppose that we have
reached a point where we have obtained the following tableau. Apply one more pivot
operation, indicating the highlighted row and column and the row operations you carry
out. What can you conclude from your updated tableau?
x1 12 23
81
82
83
S4
$1
-20
1 1
0
0
0
3
82
3 0
-2
0
1
2
0
6
12
1
1
-3
0
0
1
0
2
84
-3 0
2
0
0
-1 1 4
2
-2
0 11
0
0
-4
0
-8
b) Solve the following linear program using the 2-phase simplex algorithm. You should give
the initial tableau and each further tableau produced during the execution of the
algorithm. If the program has an optimal solution, give this solution and state its
objective value. If it does not have an optimal solution, say why.
maximize 21 - - 2x2 + x3 - 4x4
subject to 2x1+x22x3x4≥ 1,
5x1+x2-x3-4 -1,
2x1+x2-x3-342,
1, 2, 3, 4 ≥0.
Suppose we have a linear program in standard equation form
maximize c'x
subject to Ax=b,
x≥ 0.
and suppose u, v, and w are all optimal solutions to this linear program.
(a) Prove that zu+v+w is an optimal solution.
(b) If you try to adapt your proof from part (a) to prove that that u+v+w
is an optimal solution, say exactly which part(s) of the proof go wrong.
(c) If you try to adapt your proof from part (a) to prove that u+v-w is an
optimal solution, say exactly which part(s) of the proof go wrong.
(a) For the following linear programme, sketch the feasible region and the direction
of the objective function. Use you sketch to find an optimal solution to the
program. State the optimal solution and give the objective value for this
solution.
maximize +22
subject to 1 + 2x2 ≤ 4,
1 +3x2 ≤ 12,
x1, x2 ≥0
(b) For the following linear programme, sketch the feasible region and the direction
of the objective function. Explain, making reference to your sketch, why this
linear programme is unbounded.
maximize
₁+%2
subject to
-2x1 + x2 ≤ 4,
x1 - 2x2 ≤4,
x1 + x2 ≥ 7,
x1,x20
Give any feasible solution to the linear programme for which the objective
value is 40 (you do not need to justify your answer).
Chapter 12 Solutions
Discrete Mathematics With Applications
Ch. 12.1 - If x and y are strings, the concatenation of x and...Ch. 12.1 - Prob. 2TYCh. 12.1 - Prob. 3TYCh. 12.1 - Prob. 4TYCh. 12.1 - Prob. 5TYCh. 12.1 - Prob. 6TYCh. 12.1 - Prob. 7TYCh. 12.1 - Use of a single dot in a regular expression stands...Ch. 12.1 - Prob. 9TYCh. 12.1 - If r is a regular expression, the notation r +...
Ch. 12.1 - Prob. 11TYCh. 12.1 - Prob. 12TYCh. 12.1 - Prob. 1ESCh. 12.1 - Prob. 2ESCh. 12.1 - Prob. 3ESCh. 12.1 - In 4—6, describe L1L2,L1L2, and (L1L2)*for the...Ch. 12.1 - Prob. 5ESCh. 12.1 - Prob. 6ESCh. 12.1 - Prob. 7ESCh. 12.1 - Prob. 8ESCh. 12.1 - In 7—9, add parentheses to emphasize the order of...Ch. 12.1 - Prob. 10ESCh. 12.1 - In 10—12, use the rules about order of precedence...Ch. 12.1 - Prob. 12ESCh. 12.1 - In 13—15, use set notation to derive the language...Ch. 12.1 - Prob. 14ESCh. 12.1 - Prob. 15ESCh. 12.1 - Prob. 16ESCh. 12.1 - In 16—18, write five strings that belong to the...Ch. 12.1 - Prob. 18ESCh. 12.1 - Prob. 19ESCh. 12.1 - Prob. 20ESCh. 12.1 - In 19—21, use words to describe the language...Ch. 12.1 - Prob. 22ESCh. 12.1 - In 22—24, indicate whether the given strings...Ch. 12.1 - Prob. 24ESCh. 12.1 - Prob. 25ESCh. 12.1 - Prob. 26ESCh. 12.1 - In 25—27, find a regular expression that defines...Ch. 12.1 - Let r, s, and t be regular expressions over...Ch. 12.1 - Prob. 29ESCh. 12.1 - Prob. 30ESCh. 12.1 - Prob. 31ESCh. 12.1 - In 31—39, write a regular expression to define the...Ch. 12.1 - Prob. 33ESCh. 12.1 - Prob. 34ESCh. 12.1 - Prob. 35ESCh. 12.1 - Prob. 36ESCh. 12.1 - Prob. 37ESCh. 12.1 - Prob. 38ESCh. 12.1 - Prob. 39ESCh. 12.1 - Prob. 40ESCh. 12.1 - Write a regular expression to define the set of...Ch. 12.2 - The five objects that make up a finite-state...Ch. 12.2 - The next-state table for an automaton shows the...Ch. 12.2 - In the annotated next-state table, the initial...Ch. 12.2 - A string w consisting of input symbols is accepted...Ch. 12.2 - The language accepted by a finite-state automaton...Ch. 12.2 - If N is the next-stale function for a finite-state...Ch. 12.2 - One part of Kleene’s theorem says that given any...Ch. 12.2 - The second part of Kleene’s theorem says that...Ch. 12.2 - A regular language is .__________Ch. 12.2 - Given the language consisting of all strings of...Ch. 12.2 - Find the state of the vending machine in Example...Ch. 12.2 - Prob. 2ESCh. 12.2 - Prob. 3ESCh. 12.2 - Prob. 4ESCh. 12.2 - Prob. 5ESCh. 12.2 - In 2—7, a finite-state automaton is given by a...Ch. 12.2 - In 2—7, a finite-state automaton is given by a...Ch. 12.2 - In 8 and 9, a finite-state automaton is given by...Ch. 12.2 - In 8 and 9, a finite-state automaton is given by...Ch. 12.2 - A finite-state automaton A given by the transition...Ch. 12.2 - A finite-state automaton A given by the transition...Ch. 12.2 - Prob. 12ESCh. 12.2 - Consider again the finite-state automaton of...Ch. 12.2 - In each of 14—19, (a) find the language accepted...Ch. 12.2 - Prob. 15ESCh. 12.2 - Prob. 16ESCh. 12.2 - Prob. 17ESCh. 12.2 - Prob. 18ESCh. 12.2 - Prob. 19ESCh. 12.2 - In each of 20—28, (a) design an automaton with the...Ch. 12.2 - Prob. 21ESCh. 12.2 - Prob. 22ESCh. 12.2 - Prob. 23ESCh. 12.2 - Prob. 24ESCh. 12.2 - Prob. 25ESCh. 12.2 - Prob. 26ESCh. 12.2 - In each of 20—28, (a) design an automaton with the...Ch. 12.2 - Prob. 28ESCh. 12.2 - Prob. 29ESCh. 12.2 - Prob. 30ESCh. 12.2 - In 29—47, design a finite-state automaton to...Ch. 12.2 - Prob. 32ESCh. 12.2 - Prob. 33ESCh. 12.2 - Prob. 34ESCh. 12.2 - In 29—47, design a finite-state automaton to...Ch. 12.2 - Prob. 36ESCh. 12.2 - Prob. 37ESCh. 12.2 - Prob. 38ESCh. 12.2 - Prob. 39ESCh. 12.2 - Prob. 40ESCh. 12.2 - Prob. 41ESCh. 12.2 - Prob. 42ESCh. 12.2 - Prob. 43ESCh. 12.2 - Prob. 44ESCh. 12.2 - Prob. 45ESCh. 12.2 - In 29—47, design a finite-state automaton to...Ch. 12.2 - Prob. 47ESCh. 12.2 - Prob. 48ESCh. 12.2 - Write a computer algorithm that simulates the...Ch. 12.2 - Prob. 50ESCh. 12.2 - Prob. 51ESCh. 12.2 - Prob. 52ESCh. 12.2 - Prob. 53ESCh. 12.2 - a. Let A be a finite-state automaton with input...Ch. 12.3 - Given a finite-state automaton A with...Ch. 12.3 - Prob. 2TYCh. 12.3 - Given states s and t in a finite-state automaton...Ch. 12.3 - Prob. 4TYCh. 12.3 - Prob. 5TYCh. 12.3 - Consider the finite-state automaton A given by the...Ch. 12.3 - Consider the finite-state automaton A given by the...Ch. 12.3 - Consider the finite-state automaon A discussed in...Ch. 12.3 - Consider the finite-state automaton given by the...Ch. 12.3 - Consider the finite-state automaton given by the...Ch. 12.3 - Consider the finite-state automaton given by the...Ch. 12.3 - Prob. 7ESCh. 12.3 - Prob. 8ESCh. 12.3 - Prob. 9ESCh. 12.3 - Prob. 10ESCh. 12.3 - Prob. 11ESCh. 12.3 - Prob. 12ESCh. 12.3 - Prob. 13ESCh. 12.3 - Prob. 14ESCh. 12.3 - Prob. 15ESCh. 12.3 - Prob. 16ESCh. 12.3 - Prob. 17ESCh. 12.3 - Prob. 18ES
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.Similar questions
- find the domain of the function f(x)arrow_forwardFor each of the following functions, find the Taylor Series about the indicated center and also determine the interval of convergence for the series. 1. f(x) = ex-2, c = 2 Π == 2. f(x) = sin(x), c = 2arrow_forwardQUESTION 5. Show that if 0 ≤r≤n, then r+2 r r (c) + (+³) + (+³) +- + (*) -(+) n n+ = r (1)...using induction on n. (2) ...using a combinatorial proof.arrow_forward
- Use a power series to approximate each of the following to within 3 decimal places: 1. arctan 2. In (1.01)arrow_forwardFor each of the following power series, find the interval of convergence and the radius of convergence: n² 1.0 (x + 1)" n=1 շո 3n 2. Σ n=1 (x-3)n n3arrow_forwardUse a known series to find a power series in x that has the given function as its sum: 1. xcos(x³) 2. In (1+x) xarrow_forward
- if n is odd integer then 4 does not divide narrow_forwardor W Annuities L Question 2, 5.3.7 > Find the future value for the ordinary annuity with the given payment and interest rate. PMT = $2,000; 1.65% compounded quarterly for 11 years. The future value of the ordinary annuity is $ (Do not round until the final answer. Then round to the nearest cent as needed.) example Get more help Q Search 30 Larrow_forwardFind the cdf of a random variable Y whose pdf is given by; 2, 0≤x≤1 1/3, 0≤x≤1 a) f(x)=3, 2≤x≤4 0, elsewhere 2, 1≤x≤2 b) f(x)= (3-x)2, 2≤x≤3 0, elsewherearrow_forward
- For all integers a and b, a + b is not ≡ 0(mod n) if and only if a is not ≡ 0(mod n)a or is not b ≡ 0(mod n). Is conjecture true or false?why?arrow_forwardor W Annuities L Question 2, 5.3.7 > Find the future value for the ordinary annuity with the given payment and interest rate. PMT = $2,000; 1.65% compounded quarterly for 11 years. The future value of the ordinary annuity is $ (Do not round until the final answer. Then round to the nearest cent as needed.) example Get more help Q Search 30 Larrow_forwardThere are m users who share a computer system. Each user alternates between "thinking" intervals whose durations are independent exponentially distributed with parameter Y, and an "active" mode that starts by submitting a service re- quest. The server can only serve one request at a time, and will serve a request completely before serving other requests. The service times of different requests are independent exponentially distributed random variables with parameter μ, and also independent of the thinking times of the users. Construct a Markov chain model and derive the steady-state distribution of the number of pending requests, including the one presently served, if any.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Elements Of Modern AlgebraAlgebraISBN:9781285463230Author:Gilbert, Linda, JimmiePublisher:Cengage Learning,
Algebra: Structure And Method, Book 1AlgebraISBN:9780395977224Author:Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. ColePublisher:McDougal Littell
Elements Of Modern Algebra
Algebra
ISBN:9781285463230
Author:Gilbert, Linda, Jimmie
Publisher:Cengage Learning,
Algebra: Structure And Method, Book 1
Algebra
ISBN:9780395977224
Author:Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. Cole
Publisher:McDougal Littell
Finite State Machine (Finite Automata); Author: Neso Academy;https://www.youtube.com/watch?v=Qa6csfkK7_I;License: Standard YouTube License, CC-BY
Finite State Machine (Prerequisites); Author: Neso Academy;https://www.youtube.com/watch?v=TpIBUeyOuv8;License: Standard YouTube License, CC-BY