DISCRETE MATHEMATICS-CONNECT ACCESS ONLY
8th Edition
ISBN: 9781264309696
Author: ROSEN
Publisher: MCG
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 13.4, Problem 27E
To determine
To show:
11 and 10 are distinguishable with respect to L and that the strings 1 and 11 are indistinguishable with respect to L.
Expert Solution & Answer

Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
1. Abel's Theorem. The goal in this problem is to prove Abel's theorem by following a series of steps
(each step must be justified).
Theorem 0.1 (Abel's Theorem).
If y1 and y2 are solutions of the differential equation
y" + p(t) y′ + q(t) y = 0,
where p and q are continuous on an open interval, then the Wronskian is given by
W (¥1, v2)(t) = c exp(− [p(t) dt),
where C is a constant that does not depend on t. Moreover, either W (y1, y2)(t) = 0 for every t in I or
W (y1, y2)(t) = 0 for every t in I.
1. (a) From the two equations (which follow from the hypotheses),
show that
y" + p(t) y₁ + q(t) y₁ = 0 and y½ + p(t) y2 + q(t) y2 = 0,
2. (b) Observe that
Hence, conclude that
(YY2 - Y1 y2) + P(t) (y₁ Y2 - Y1 Y2) = 0.
W'(y1, y2)(t) = yY2 - Y1 y2-
W' + p(t) W = 0.
3. (c) Use the result from the previous step to complete the proof of the theorem.
eBook
Print Item
Question Content Area
Support Department Cost Allocation—Reciprocal Services Method
Blue Africa Inc. produces laptops and desktop computers. The company’s production activities mainly occur in what the company calls its Laser and Forming departments. The Cafeteria and Security departments support the company’s production activities and allocate costs based on the number of employees and square feet, respectively. The total cost of the Security Department is $261,000. The total cost of the Cafeteria Department is $300,000. The number of employees and the square footage in each department are as follows:
Department
Employees
Square Feet
Security
10
570
Cafeteria
28
2,400
Laser
40
4,800
Forming
50
800
Using the reciprocal services method of support department cost allocation, determine the total costs from the Security Department that should be allocated to…
I need help with this problem and an explanation of the solution for the image described below. (Statistics: Engineering Probabilities)
Chapter 13 Solutions
DISCRETE MATHEMATICS-CONNECT ACCESS ONLY
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
- I need help with this problem and an explanation of the solution for the image described below. (Statistics: Engineering Probabilities)arrow_forward2. Observations on the Wronskian. Suppose the functions y₁ and y2 are solutions to the differential equation p(x)y" + q(x)y' + r(x) y = 0 on an open interval I. 1. (a) Prove that if y₁ and y2 both vanish at the same point in I, then y₁ and y2 cannot form a fundamental set of solutions. 2. (b) Prove that if y₁ and y2 both attain a maximum or minimum at the same point in I, then y₁ and Y2 cannot form a fundamental set of solutions. 3. (c) show that the functions & and t² are linearly independent on the interval (−1, 1). Verify that both are solutions to the differential equation t² y″ – 2ty' + 2y = 0. Then justify why this does not contradict Abel's theorem. 4. (d) What can you conclude about the possibility that t and t² are solutions to the differential equation y" + q(x) y′ + r(x)y = 0?arrow_forwardThis exercise is based on the following data on four bodybuilding supplements. (Figures shown correspond to a single serving.) Creatine(grams) L-Glutamine(grams) BCAAs(grams) Cost($) Xtend(SciVation) 0 2.5 7 1.00 Gainz(MP Hardcore) 2 3 6 1.10 Strongevity(Bill Phillips) 2.5 1 0 1.20 Muscle Physique(EAS) 2 2 0 1.00 Your personal trainer suggests that you supplement with at least 10 grams of creatine, 39 grams of L-glutamine, and 90 grams of BCAAs each week. You are thinking of combining Xtend and Gainz to provide you with the required nutrients. How many servings of each should you combine to obtain a week's supply that meets your trainer's specifications at the least cost? (If an answer does not exist, enter DNE.) servings of xtend servings of gainzarrow_forward
- PROBLEM 7: Binary Relations, Functions and Orderings (15 pts) 1. (2 pts) Prove that ({2, 3, 4, 6, 24, 36, 72}, /) is a poset, create its corresponding Hasse diagram and identify maximal and minimal elements. 2. (1 pts) Prove that (P{1, 2, 3}, C) is a poset, create its corresponding Hasse diagram and identify maximal and minimal elements 3. Assume the following mapping, captured by variable map: map = { 72 {1,2,3}, 36 {3}, 24 {1,2}, 6- → {3}, 4 {1,3}, 2➡ {} } Provide answers to the following in detail (in plain english and formally): (a) (2 pts) Is variable map a function? If so, is it a total or a partial function? Identify domain and codomain. (b) (10 pts) Discuss all properties (injectivity, surjectivity, bijection, order preserving, order reflecting, order embedding, isomorphism). NOTE: When we reason formally on a property we must state: (1) What Law do we expect to hold or not hold, and (2) Does this Law indeed hold or Is this Law violated?arrow_forwardI need help with this problem and an explanation of the solution for the image described below. (Statistics: Engineering Probabilities)arrow_forwardI need help with this problem and an explanation of the solution for the image described below. (Statistics: Engineering Probabilities)arrow_forward
- DATA TABLE VALUES Meal Price ($) 22.78 31.90 33.89 22.77 18.04 23.29 35.28 42.38 36.88 38.55 41.68 25.73 34.19 31.75 25.24 26.32 19.57 36.57 32.97 36.83 30.17 37.29 25.37 24.71 28.79 32.83 43.00 35.23 34.76 33.06 27.73 31.89 38.47 39.42 40.72 43.92 36.51 45.25 33.51 29.17 30.54 26.74 37.93arrow_forwardI need help with this problem and an explanation of the solution for the image described below. (Statistics: Engineering Probabilities)arrow_forwardQuestion 4 Find an equation of (a) The plane through the point (2, 0, 1) and perpendicular to the line x = y=2-t, z=3+4t. 3t, (b) The plane through the point (3, −2, 8) and parallel to the plane z = x+y. (c) The plane that contains the line x = 1+t, y = 2 − t, z = 4 - 3t and is parallel to the plane 5x + 2y + z = 1. (d) The plane that passes through the point (1,2,3) and contains the line x = 3t, y = 1+t, and z = 2-t. (e) The plane that contains the lines L₁: x = 1 + t, y = 1 − t, z = 2t and L2 : x = 2 − s, y = s, z = 2.arrow_forward
- Please find all values of x.arrow_forwardSales personnel for Skillings Distributors submit weekly reports listing the customer contacts made during the week. A sample of 65 weekly reports showed a sample mean of 19.5 customer contacts per week. The sample standard deviation was 5.2. Provide 90% and 95% confidence intervals for the population mean number of weekly customer contacts for the sales personnel. 90% Confidence interval, to 2 decimals: ( , ) 95% Confidence interval, to 2 decimals:arrow_forwardA simple random sample of 40 items resulted in a sample mean of 25. The population standard deviation is 5. a. What is the standard error of the mean (to 2 decimals)? b. At 95% confidence, what is the margin of error (to 2 decimals)?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,Linear Algebra: A Modern IntroductionAlgebraISBN:9781285463247Author:David PoolePublisher:Cengage LearningMathematics For Machine TechnologyAdvanced MathISBN:9781337798310Author:Peterson, John.Publisher:Cengage Learning,

Elements Of Modern Algebra
Algebra
ISBN:9781285463230
Author:Gilbert, Linda, Jimmie
Publisher:Cengage Learning,

Linear Algebra: A Modern Introduction
Algebra
ISBN:9781285463247
Author:David Poole
Publisher:Cengage Learning

Mathematics For Machine Technology
Advanced Math
ISBN:9781337798310
Author:Peterson, John.
Publisher:Cengage Learning,
Propositional Logic, Propositional Variables & Compound Propositions; Author: Neso Academy;https://www.youtube.com/watch?v=Ib5njCwNMdk;License: Standard YouTube License, CC-BY
Propositional Logic - Discrete math; Author: Charles Edeki - Math Computer Science Programming;https://www.youtube.com/watch?v=rL_8y2v1Guw;License: Standard YouTube License, CC-BY
DM-12-Propositional Logic-Basics; Author: GATEBOOK VIDEO LECTURES;https://www.youtube.com/watch?v=pzUBrJLIESU;License: Standard Youtube License
Lecture 1 - Propositional Logic; Author: nptelhrd;https://www.youtube.com/watch?v=xlUFkMKSB3Y;License: Standard YouTube License, CC-BY
MFCS unit-1 || Part:1 || JNTU || Well formed formula || propositional calculus || truth tables; Author: Learn with Smily;https://www.youtube.com/watch?v=XV15Q4mCcHc;License: Standard YouTube License, CC-BY