Discrete Mathematics and Its Applications ( 8th International Edition ) ISBN:9781260091991
8th Edition
ISBN: 9781259676512
Author: Kenneth H Rosen
Publisher: McGraw-Hill Education
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 13.3, Problem 7E
To determine
To show:
that
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Given the sample space:
ΩΞ
= {a,b,c,d,e,f}
and events:
{a,b,e,f}
A = {a, b, c, d}, B = {c, d, e, f}, and C = {a, b, e, f}
For parts a-c: determine the outcomes in each of the provided sets. Use proper set
notation.
a.
(ACB)
C
(AN (BUC) C) U (AN (BUC))
AC UBC UCC
b.
C.
d.
If the outcomes in 2 are equally likely, calculate P(AN BNC).
H-/ test the Series
1.12
7√2
by ratio best
2n
2-12-
nz
by vitio test
en
In Exercises 1-14, state whether each statement is true or
false. If false, give a reason.
1. The set of stores located in the state of Wyoming is a well-
defined set.
2. The set of the three best songs is a well-defined set.
3. maple = {oak, elm, maple, sycamore}
4{} cơ
5. {3, 6, 9, 12,...} and {2, 4, 6, 8, ...} are disjoint sets.
6. {Mercury, Venus, Earth, Mars} is an example of a set in
roster form.
7. {candle, picture, lamp} = {picture, chair, lamp }
8. {apple, orange, banana, pear} is equivalent to
{tomato, corn, spinach, radish}.
Chapter 13 Solutions
Discrete Mathematics and Its Applications ( 8th International Edition ) ISBN:9781260091991
Ch. 13.1 - Exercises 1-3 refer to the grammar with start...Ch. 13.1 - Exercises 1-3 refer to the grammar with start...Ch. 13.1 - Prob. 3ECh. 13.1 - Let G=(V,T,S,P) be the phrase-structure grammar...Ch. 13.1 - Prob. 5ECh. 13.1 - Prob. 6ECh. 13.1 - Prob. 7ECh. 13.1 - Show that the grammar given in Example 5 generates...Ch. 13.1 - Prob. 9ECh. 13.1 - Prob. 10E
Ch. 13.1 - Construct a derivation of 021222 in the grammar...Ch. 13.1 - Show that the grammar given in Example 7 generates...Ch. 13.1 - s13. Find a phrase-structure grammar for each of...Ch. 13.1 - Find a phrase-structure grammar for each of these...Ch. 13.1 - Find a phrase-structure grammar for each of these...Ch. 13.1 - Construct phrase-structure grammars to generate...Ch. 13.1 - Construct phrase-structure grammars to generate...Ch. 13.1 - Construct phrase-structure grammars to generate...Ch. 13.1 - Prob. 19ECh. 13.1 - A palindrome is a string that reads the same...Ch. 13.1 - Let G1 and G2 be context-free grammars, generating...Ch. 13.1 - Prob. 22ECh. 13.1 - Construct derivation trees for the sentences in...Ch. 13.1 - Let G be the grammar with V={a,b,c,S};T={a,b,c} ;...Ch. 13.1 - Prob. 25ECh. 13.1 - Prob. 26ECh. 13.1 - Prob. 27ECh. 13.1 - a) Explain what the productions are in a grammar...Ch. 13.1 - Prob. 29ECh. 13.1 - a) Construct a phrasestructure grammar for the set...Ch. 13.1 - Give production rules in Backus-Naur form for an...Ch. 13.1 - Prob. 32ECh. 13.1 - Prob. 33ECh. 13.1 - Prob. 34ECh. 13.1 - Prob. 35ECh. 13.1 - Prob. 36ECh. 13.1 - Prob. 37ECh. 13.1 - Prob. 38ECh. 13.1 - Prob. 39ECh. 13.1 - Prob. 40ECh. 13.1 - Prob. 41ECh. 13.1 - Let G be a grammar and let R be the relation...Ch. 13.2 - Draw the state diagrams for the finite-state...Ch. 13.2 - Give the state tables for the finite-state machine...Ch. 13.2 - Find the output generated from the input string...Ch. 13.2 - Find the output generated from the input string...Ch. 13.2 - Find the output for each of these input strings...Ch. 13.2 - Find the output for each of these input strings...Ch. 13.2 - Construct a finite-state machine that models an...Ch. 13.2 - Prob. 8ECh. 13.2 - Construct a finite-state machine that delays an...Ch. 13.2 - Construct a finite-state machine that changes...Ch. 13.2 - Construct a finite-state machine for the log-on...Ch. 13.2 - Construct a finite-state machine for lock that...Ch. 13.2 - Construct a finite-state machine for a toll...Ch. 13.2 - Construct a finite-state machine for entering a...Ch. 13.2 - Construct a finite-state machine for a restricted...Ch. 13.2 - Construct a finite-state machine that gives an...Ch. 13.2 - Prob. 17ECh. 13.2 - Construct a finite-state machine that determines...Ch. 13.2 - Construct a finite-state machine that determines...Ch. 13.2 - Prob. 20ECh. 13.2 - Prob. 21ECh. 13.2 - Find the output string generated by the Moore...Ch. 13.2 - Prob. 23ECh. 13.2 - Construct a Moore machine that gives an output of...Ch. 13.2 - Prob. 25ECh. 13.3 - Prob. 1ECh. 13.3 - 2. Show that if A is a set of strings, then.
Ch. 13.3 - Find all pairs of sets of strings A and B for...Ch. 13.3 - Show that these equalities hold. a) {}*={} b)...Ch. 13.3 - Prob. 5ECh. 13.3 - Prob. 6ECh. 13.3 - Prob. 7ECh. 13.3 - Prob. 8ECh. 13.3 - Prob. 9ECh. 13.3 - Determine whether the string 01001 is in each of...Ch. 13.3 - Determine whether each of these strings is...Ch. 13.3 - Determine whether each of these strings is...Ch. 13.3 - Determine whether all the strings in each of these...Ch. 13.3 - Show that if M=(S,I,f,so,F) is a deterministic...Ch. 13.3 - Given a finite-state automaton M=(S,I,f,so,F) ,...Ch. 13.3 - In Exercises 16—22 find the language recognized by...Ch. 13.3 - In Exercises 16—22 find the language recognized by...Ch. 13.3 - Prob. 18ECh. 13.3 - Prob. 19ECh. 13.3 - In Exercises 16—22 find the language recognized by...Ch. 13.3 - In Exercises 16—22 find the language recognized by...Ch. 13.3 - Prob. 22ECh. 13.3 - Construct a deterministic finite-state automaton...Ch. 13.3 - Construct a deterministic finite-state automaton...Ch. 13.3 - Construct a deterministic finite-state automaton...Ch. 13.3 - Construct a deterministic finite-state automaton...Ch. 13.3 - Prob. 27ECh. 13.3 - Construct a deterministic finite-state automaton...Ch. 13.3 - Prob. 29ECh. 13.3 - Construct a deterministic finite-state automaton...Ch. 13.3 - Construct a deterministic finite-state automaton...Ch. 13.3 - Construct a deterministic finite-state automaton...Ch. 13.3 - Prob. 33ECh. 13.3 - Prob. 34ECh. 13.3 - Prob. 35ECh. 13.3 - Prob. 36ECh. 13.3 - Prob. 37ECh. 13.3 - Prob. 38ECh. 13.3 - Prob. 39ECh. 13.3 - Use Exercise 39 finite-state automata constructed...Ch. 13.3 - Prob. 41ECh. 13.3 - Prob. 42ECh. 13.3 - Prob. 43ECh. 13.3 - Prob. 44ECh. 13.3 - Prob. 45ECh. 13.3 - In Exercises 43-49 find the language recognized by...Ch. 13.3 - Prob. 47ECh. 13.3 - In Exercises 43-49 find the language recognized by...Ch. 13.3 - Prob. 49ECh. 13.3 - Find a deterministic finite-state automaton that...Ch. 13.3 - Prob. 51ECh. 13.3 - Find a deterministic finite-state automaton that...Ch. 13.3 - Find a deterministic finite-state automaton that...Ch. 13.3 - Find a deterministic finite-state automaton that...Ch. 13.3 - Find a deterministic finite-state automaton that...Ch. 13.3 - Find a nondeterministic finite-state automaton...Ch. 13.3 - Prob. 57ECh. 13.3 - Prob. 58ECh. 13.3 - Prob. 59ECh. 13.3 - Prob. 60ECh. 13.3 - Prob. 61ECh. 13.3 - Prob. 62ECh. 13.4 - Describe in words the strings in each of these...Ch. 13.4 - Prob. 2ECh. 13.4 - Prob. 3ECh. 13.4 - Prob. 4ECh. 13.4 - Express each of these sets using a regular...Ch. 13.4 - Express each of these sets using a regular...Ch. 13.4 - Express each of these sets using a regular...Ch. 13.4 - Construct deterministic finite-state automata that...Ch. 13.4 - Construct nondeterministic finite-state automata...Ch. 13.4 - Construct nondeterministic finite-state automata...Ch. 13.4 - Show that if A is a regular set, then AR, the set...Ch. 13.4 - Using the construction described in the proof of...Ch. 13.4 - Using the construction described in the proof of...Ch. 13.4 - Construct a nondeterministic finite-state...Ch. 13.4 - In Exercises 15-17 conflict a regular grammar...Ch. 13.4 - In Exercises 15-17 conflict a regular grammar...Ch. 13.4 - In Exercises 15-17 conflict a regular grammar...Ch. 13.4 - Show that the finite-state automaton constructed...Ch. 13.4 - Show that the regular grammar constructed from a...Ch. 13.4 - Show that every nondeterministic finite-state...Ch. 13.4 - Let M=(S,I,f,s0,F) be a deterministic finite-state...Ch. 13.4 - One important technique used to prove that certain...Ch. 13.4 - Show that the set 02n1nn=0,1,2,... is not regular...Ch. 13.4 - Show that the set {1n2n=0,1,2,...} is not regular...Ch. 13.4 - Show that the set of palindromes over {0, 1} is...Ch. 13.4 - Prob. 26ECh. 13.4 - Prob. 27ECh. 13.4 - Prob. 28ECh. 13.4 - Prob. 29ECh. 13.4 - Prob. 30ECh. 13.4 - Use Exercise 29 to show that the language...Ch. 13.5 - Let T be the Turing machine defined by the...Ch. 13.5 - Let T be the Turing machine defined by the...Ch. 13.5 - What does the Turing machine defined by the...Ch. 13.5 - What does the Turing machine described by the...Ch. 13.5 - What does the Turing machine described by the...Ch. 13.5 - Construct a Turing machine with tape 0, 1, and B...Ch. 13.5 - Construct a Turning machine with tape symbols 0,...Ch. 13.5 - Construct a Turing machine with tape symbols 0, 1,...Ch. 13.5 - Construct a Turing machine with tape symbols 0, 1,...Ch. 13.5 - Construct a Turing machine with tape symbols 0, 1,...Ch. 13.5 - Construct a Turing machine that recognizes the set...Ch. 13.5 - Construct a Turing machine that recognizes the set...Ch. 13.5 - Construct a Turing machine that recognizes the set...Ch. 13.5 - Show at each step the contents of the tape of the...Ch. 13.5 - Explain why the Turing machine in Example 3...Ch. 13.5 - Construct a Turing machine that recognizes the set...Ch. 13.5 - Construct a Turing machine that recognizes the set...Ch. 13.5 - Construct a Turing machine that computes the...Ch. 13.5 - Construct a Turing machine that computes the...Ch. 13.5 - Construct a Turing machine that computes the...Ch. 13.5 - Construct a Turing machine that computes the...Ch. 13.5 - Construct a Turing machine that computes the...Ch. 13.5 - Construct a Turing machine that computes the...Ch. 13.5 - Construct a Turing machine that computes the...Ch. 13.5 - Construct a Turing machine that computes the...Ch. 13.5 - Construct a Turning machine that computes the...Ch. 13.5 - Prob. 27ECh. 13.5 - Prob. 28ECh. 13.5 - Which of the following problems is a decision...Ch. 13.5 - Which of the following problems is a decision...Ch. 13.5 - Prob. 31ECh. 13.5 - Show that the function B(n) cannot be computed by...Ch. 13 - a) Define a phrase-structure grammar. b) What does...Ch. 13 - a) What is the language generated by a...Ch. 13 - Prob. 3RQCh. 13 - Prob. 4RQCh. 13 - Prob. 5RQCh. 13 - a) What is a finite-state machine? b) Show how a...Ch. 13 - Prob. 7RQCh. 13 - Prob. 8RQCh. 13 - Prob. 9RQCh. 13 - Prob. 10RQCh. 13 - a) Define a nondeterministic finite-state...Ch. 13 - a) Define the set of regular expressions over a...Ch. 13 - Prob. 13RQCh. 13 - Prob. 14RQCh. 13 - Prob. 15RQCh. 13 - Prob. 16RQCh. 13 - Describe how Turing machines are used to recognize...Ch. 13 - Prob. 18RQCh. 13 - Prob. 19RQCh. 13 - Prob. 1SECh. 13 - Prob. 2SECh. 13 - Prob. 3SECh. 13 - Prob. 4SECh. 13 - Prob. 5SECh. 13 - Prob. 6SECh. 13 - Prob. 7SECh. 13 - Prob. 8SECh. 13 - Prob. 9SECh. 13 - Prob. 10SECh. 13 - Prob. 11SECh. 13 - Prob. 12SECh. 13 - Prob. 13SECh. 13 - Construct a finite-state machine with output that...Ch. 13 - Construct a finite-state machine with output that...Ch. 13 - Prob. 16SECh. 13 - Prob. 17SECh. 13 - Prob. 18SECh. 13 - Construct a deterministic finite-state automaton...Ch. 13 - Prob. 20SECh. 13 - Prob. 21SECh. 13 - Prob. 22SECh. 13 - Prob. 23SECh. 13 - Prob. 24SECh. 13 - Prob. 25SECh. 13 - Show that {02nnN} is not regular. You may use the...Ch. 13 - Prob. 27SECh. 13 - Prob. 28SECh. 13 - Construct a Turing machine that computes the...Ch. 13 - Prob. 30SECh. 13 - Prob. 1CPCh. 13 - Prob. 2CPCh. 13 - Prob. 3CPCh. 13 - Prob. 4CPCh. 13 - Given the state table of a Moore machine and an...Ch. 13 - Given the state table of a Mealy machine and an...Ch. 13 - Given the state table of a deterministic...Ch. 13 - Prob. 8CPCh. 13 - Prob. 9CPCh. 13 - Prob. 10CPCh. 13 - Given a regular grammar, construct a finite-state...Ch. 13 - Given a finite-state automaton, construct a...Ch. 13 - Prob. 13CPCh. 13 - Solve the busy beaver problem for two states by...Ch. 13 - Prob. 2CAECh. 13 - Prob. 3CAECh. 13 - Prob. 4CAECh. 13 - Prob. 5CAECh. 13 - Prob. 1WPCh. 13 - Describe the Backus-Naur form (and extended...Ch. 13 - Explain how finite-state machines are used by...Ch. 13 - Explain how finite-state machines are used in the...Ch. 13 - Explain how finite-state machines are used in...Ch. 13 - Compare the use of Moore machines versus Mealy...Ch. 13 - Explain the concept of minimizing finite-state...Ch. 13 - Give the definition of cellular automata, Explain...Ch. 13 - Define a pushdown automaton. Explain how pushdown...Ch. 13 - Define a linear-bounded automaton. Explain how...Ch. 13 - Prob. 11WPCh. 13 - Prob. 12WPCh. 13 - Prob. 13WPCh. 13 - Show that a Turing machine can simulate any action...Ch. 13 - Prob. 15WPCh. 13 - Describe the basic concepts of the lambda-calculus...Ch. 13 - Show that a Turing machine as defined in this...Ch. 13 - Prob. 18WP
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
- Consider a single-server queueing system that can hold a maximum of two customers excluding those being served. The server serves customers only in batches of two, and the service time (for a batch) has an exponential distribution with a mean of 1 unit of time. Thus if the server is idle and there is only one customer in the system, then the server must wait for another arrival before beginning service. The customers arrive according to a Poisson process at a mean rate of 1 per unit of time. (1). Draw the rate diagram. (Hint: think about how the state will change after one service completion.) (2). Set up the rate balance equations. (Hint: use the rate balance equations 1.) (3). Compute pn and L. (4). Compute the actual mean arrival rate Ā.arrow_forwardSuppose a sample of O-rings was obtained and the wall thickness (in inches) of each was recorded. Use a normal probability plot to assess whether the sample data could have come from a population that is normally distributed. Click here to view the table of critical values for normal probability plots. Click here to view page 1 of the standard normal distribution table. Click here to view page 2 of the standard normal distribution table. 0.191 0.186 0.201 0.2005 0.203 0.210 0.234 0.248 0.260 0.273 0.281 0.290 0.305 0.310 0.308 0.311 Using the correlation coefficient of the normal probability plot, is it reasonable to conclude that the population is normally distributed? Select the correct choice below and fill in the answer boxes within your choice. (Round to three decimal places as needed.) ○ A. Yes. The correlation between the expected z-scores and the observed data, , exceeds the critical value, . Therefore, it is reasonable to conclude that the data come from a normal population. ○…arrow_forwardHale / test the Series 1.12 7√2 2n by ratio best 2-12- nz by vico tio test en - プ n2 rook 31() by mood fest 4- E (^)" by root test Inn 5-E 3' b. E n n³ 2n by ratio test ٤ by Comera beon Test (n+2)!arrow_forward
- ding question ypothesis at a=0.01 and at a = 37. Consider the following hypotheses: 20 Ho: μ=12 HA: μ12 Find the p-value for this hypothesis test based on the following sample information. a. x=11; s= 3.2; n = 36 b. x = 13; s=3.2; n = 36 C. c. d. x = 11; s= 2.8; n=36 x = 11; s= 2.8; n = 49arrow_forward13. A pharmaceutical company has developed a new drug for depression. There is a concern, however, that the drug also raises the blood pressure of its users. A researcher wants to conduct a test to validate this claim. Would the manager of the pharmaceutical company be more concerned about a Type I error or a Type II error? Explain.arrow_forwardFind the z score that corresponds to the given area 30% below z.arrow_forward
- Find the following probability P(z<-.24)arrow_forwardExercises Evaluate the following limits. 1. lim cot x/ln x +01x 2. lim x² In x +014 3. lim x* x0+ 4. lim (cos√√x)1/x +014 5. lim x2/(1-cos x) x10 6. lim e*/* 818 7. lim (secx - tan x) x-x/2- 8. lim [1+(3/x)]* x→∞0arrow_forwardIn Exercises 1 through 3, let xo = O and calculate P7(x) and R7(x). 1. f(x)=sin x, x in R. 2. f(x) = cos x, x in R. 3. f(x) = In(1+x), x≥0. 4. In Exercises 1, 2, and 3, for |x| 1, calculate a value of n such that P(x) approximates f(x) to within 10-6. 5. Let (an)neN be a sequence of positive real numbers such that L = lim (an+1/an) exists in R. If L < 1, show that an → 0. [Hint: Let 1111 Larrow_forwardiation 7. Let f be continuous on [a, b] and differentiable on (a, b). If lim f'(x) xia exists in R, show that f is differentiable at a and f'(a) = lim f'(x). A similar result holds for b. x-a 8. In reference to Corollary 5.4, give an example of a uniformly continuous function on [0, 1] that is differentiable on (0, 1] but whose derivative is not bounded there. 9. Recall that a fixed point of a function f is a point c such that f(c) = c. (a) Show that if f is differentiable on R and f'(x)| x if x 1 and hence In(1+x) 0. 12. For 0 л/2. (Thus, as x л/2 from the left, cos x is never large enough for x+cosx to be greater than л/2 and cot x is never small enough for x + cot x to be less than x/2.)arrow_forwardConstruct a histogram for the spot weld shear strength datain Exercise 6.2.9. Comment on the shape of the histogram. Doesit convey the same information as the stem-and-leaf display? Reference: Exercise 6.2.9 is found in the image attached belowarrow_forward1. Show that f(x) = x3 is not uniformly continuous on R. 2. Show that f(x) = 1/(x-2) is not uniformly continuous on (2,00). 3. Show that f(x)=sin(1/x) is not uniformly continuous on (0,л/2]. 4. Show that f(x) = mx + b is uniformly continuous on R. 5. Show that f(x) = 1/x2 is uniformly continuous on [1, 00), but not on (0, 1]. 6. Show that if f is uniformly continuous on [a, b] and uniformly continuous on D (where D is either [b, c] or [b, 00)), then f is uniformly continuous on [a, b]U D. 7. Show that f(x)=√x is uniformly continuous on [1, 00). Use Exercise 6 to conclude that f is uniformly continuous on [0, ∞). 8. Show that if D is bounded and f is uniformly continuous on D, then fis bounded on D. 9. Let f and g be uniformly continuous on D. Show that f+g is uniformly continuous on D. Show, by example, that fg need not be uniformly con- tinuous on D. 10. Complete the proof of Theorem 4.7. 11. Give an example of a continuous function on Q that cannot be continuously extended to R. 12.…arrow_forwardarrow_back_iosSEE MORE QUESTIONSarrow_forward_ios
Recommended textbooks for you
Elementary Linear Algebra (MindTap Course List)AlgebraISBN:9781305658004Author:Ron LarsonPublisher:Cengage Learning
Elements Of Modern AlgebraAlgebraISBN:9781285463230Author:Gilbert, Linda, JimmiePublisher:Cengage Learning,
Elementary Linear Algebra (MindTap Course List)
Algebra
ISBN:9781305658004
Author:Ron Larson
Publisher:Cengage Learning
Elements Of Modern Algebra
Algebra
ISBN:9781285463230
Author:Gilbert, Linda, Jimmie
Publisher:Cengage Learning,