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 33ES
To determine
Write a regular expression to define the given set of strings. Use the shorthand notations given in the section when ever convenient. In most cases, your expression will describe other strings in addition to the given ones. but try to make your answer fit the given strings as closely as possible wïthin reasonable space limitations.
All words that are written in lower-case letters, end in
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
3. [15] The joint PDF of RVS X and Y is given by
fx.x(x,y) = {
x) = { c(x +
{
c(x+y³),
0,
0≤x≤ 1,0≤ y ≤1
otherwise
where c is a constant.
(a) Find the value of c.
(b) Find P(0 ≤ X ≤,
The analysis of results from a leaf transmutation experiment (turning a leaf into a petal) is
summarized by the type of transformation completed:
A naturalist randomly selects three leaves from this set without replacement.
Total Textural
Transformation
Yes
No
Total
Yes
243
26
269
Total Color
Transformation
No
13
18
31
Total
256
44
300
Let X represent the number of leaves that have undergone both transformations.
The appropriate probability distribution of X is a
distribution.
The parameters are population size N =
size n =
number of events K =
and sample
The probability that at least one leaf has undergone both transformations is
probability to four decimal places.)
X has a
N
=
K=
n =
The requested probability is
distribution.
(Round the
The life time of a certain battery is modeled with the Weibull distribution with shape
parameter ẞ=2 and scale parameter 8-10 hours.
Determine the mean time until failure of batteries. (Round the answer to one decimal place.)
hours
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
- Need help pleasearrow_forwardConsider the probability distribution below. 0 1 3 f(x) 0.3 0.3 0.4 E(X)=1.5. The variance of XV (X) equals 1.65 ○ 1.28 1.56 2.33arrow_forward7. [10] Suppose that Xi, i = 1,..., 5, are independent normal random variables, where X1, X2 and X3 have the same distribution N(1, 2) and X4 and X5 have the same distribution N(-1, 1). Let (a) Find V(X5 - X3). 1 = √(x1 + x2) — — (Xx3 + x4 + X5). (b) Find the distribution of Y. (c) Find Cov(X2 - X1, Y). -arrow_forward
- 1. [10] Suppose that X ~N(-2, 4). Let Y = 3X-1. (a) Find the distribution of Y. Show your work. (b) Find P(-8< Y < 15) by using the CDF, (2), of the standard normal distribu- tion. (c) Find the 0.05th right-tail percentage point (i.e., the 0.95th quantile) of the distri- bution of Y.arrow_forward6. [10] Let X, Y and Z be random variables. Suppose that E(X) = E(Y) = 1, E(Z) = 2, V(X) = 1, V(Y) = V(Z) = 4, Cov(X,Y) = -1, Cov(X, Z) = 0.5, and Cov(Y, Z) = -2. 2 (a) Find V(XY+2Z). (b) Find Cov(-x+2Y+Z, -Y-2Z).arrow_forwardConsider the probability distribution below. 10 20 30 40 f(x) 0.3 0.4 0.2 0.1 The expected value of X equals 100 ○ 25 ○ 18 ○ 21arrow_forward
- The analysis of results from a leaf transmutation experiment (turning a leaf into a petal) is summarized by the type of transformation completed: A naturalist randomly selects three leaves from this set without replacement. Total Textural Transformation Yes No Total Yes 243 26 269 Total Color Transformation No 13 18 31 Total 256 44 300 Let X represent the number of leaves that have undergone both transformations. The appropriate probability distribution of X is a distribution. The parameters are population size N = size n = number of events K = and sample The probability that at least one leaf has undergone both transformations is probability to four decimal places.) X has a N = K= n = The requested probability is distribution. (Round thearrow_forwardThe thickness of a flange on an aircraft component is uniformly distributed between 0.95 and 1.05 millimeters. Determine the mean of flange thickness. millimeters (Two decimal places.)arrow_forwardThe following table is an output from a statistical software package. The assumed standard deviation = 1.5 Variable X N 9 Mean 29.542 Σ-1 - Sum of Squares (SS): SS = Σ₁ (x − x) ² SE Mean ? StDev Variance Sum of Squares 1.218 ? ? Fill the missing information. Round answers to 3 decimal places. SE Mean = Variance = Sum of Squares =arrow_forward
- For the random variable x = 1,2,3,4, the probability mass function is f(x) = x 10 Determine the following probabilities. Round answers to one decimal place. (a) P(X = 2) = (b) P(X ≤ 2) = (c) P(X > 4) = (d) P (0 < x < 3) =arrow_forwardThe following represents the probability distribution for the daily website crashes on a high- traffic website. Crashes Probability 0 0.20 1 0.25 2 0.30 3 0.20 4 0.05 The probability of having at least three crashes on a given day is (Keep two decimal places.) 7arrow_forwardSuppose that a coin is tossed twice so that the sample space is S= {HH, HT, TH, TT}. Let X represent the number of heads that can come up. With each sample point we can associate a number for X as shown in Table. Thus, for example, in the case of HH (i.e., 2 heads), X =2 while for TH (1 head), X = 1. It follows that X is a random variable.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Holt Mcdougal Larson Pre-algebra: Student Edition...AlgebraISBN:9780547587776Author:HOLT MCDOUGALPublisher:HOLT MCDOUGAL
Glencoe Algebra 1, Student Edition, 9780079039897...AlgebraISBN:9780079039897Author:CarterPublisher:McGraw Hill
Algebra: Structure And Method, Book 1AlgebraISBN:9780395977224Author:Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. ColePublisher:McDougal Littell
College Algebra (MindTap Course List)AlgebraISBN:9781305652231Author:R. David Gustafson, Jeff HughesPublisher:Cengage Learning
Big Ideas Math A Bridge To Success Algebra 1: Stu...AlgebraISBN:9781680331141Author:HOUGHTON MIFFLIN HARCOURTPublisher:Houghton Mifflin Harcourt
Holt Mcdougal Larson Pre-algebra: Student Edition...
Algebra
ISBN:9780547587776
Author:HOLT MCDOUGAL
Publisher:HOLT MCDOUGAL
Glencoe Algebra 1, Student Edition, 9780079039897...
Algebra
ISBN:9780079039897
Author:Carter
Publisher:McGraw Hill
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
College Algebra (MindTap Course List)
Algebra
ISBN:9781305652231
Author:R. David Gustafson, Jeff Hughes
Publisher:Cengage Learning
Big Ideas Math A Bridge To Success Algebra 1: Stu...
Algebra
ISBN:9781680331141
Author:HOUGHTON MIFFLIN HARCOURT
Publisher:Houghton Mifflin Harcourt
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