Discrete Mathematics With Applications
5th Edition
ISBN: 9781337694193
Author: EPP, Susanna S.
Publisher: Cengage Learning,
expand_more
expand_more
format_list_bulleted
Videos
Textbook Question
Chapter 12.2, Problem 8ES
In 8 and 9, a finite-state automaton is given by an annotated next-state table. For each automaton:
a. Find its states.
b. Find its input symbols.
c. Find its initial state.
d. Find its accepting states.
e. Draw its transition diagram.
8. Next-State Table
Expert Solution & Answer
Trending nowThis is a popular solution!
Students have asked these similar questions
For the finite state automaton given by the transition diagram in figure 1, find
the states, the input symbols, the initial state, the accepting states and write the
annotated next state table
Figure 1
b
-0
02
b
01
03
b
b
Human genetic material (DNA) is made up of sequences of the molecules adenosine (A), guanine (G), cytosine (C), and thymine (T), which are called bases. A codon is a sequence of three bases. Replicates are allowed, so AAA, CGC, and so forth are codons. Codons are important because each codon causes a different amino acid to be included in a protein.
a. How many different codons are there?
b. How many different codons are there in which all three bases are different?
c. The bases A and G are called purines, while C and T are called pyrimidines. How many different codons are there in which the third base is a purine and the others are pyrimidines?
d. What is the probability that all three bases are different?
e. What is the probability that the third base is a purine and the others are pyrimidines?
2. Data were collected from a random sample of 220 home sales from a community in
2003. Let Price denote the selling price (in $1000), BDR denote the number of
bedrooms, Bath denote the number of bathrooms, Hsize denote the size of the house
(in square feet), Lsize denote the lot size (in square feet), Age denote the age of the
house (in years), and Poor denote a binary variable that is equal to 1 if the condition of
the house is reported as "poor." An estimated regression yields
Price
119.2 + 0.485 BDR +23.4 Bath +0.156 Hsize +0.002 Lsize
(23.9) (2.61)
(8.94)
(0.011)
(0.00048)
+0.090 Age -48.8 Poor,
(0.311)
(10.5)
R² = 0.72, SER = 41.5
(a) What is the loss in value if a homeowner lets his house run down so that its condition
becomes "poor"?
(b) Compute the (unadjusted) R² for the regression.
(c) Is the coefficient on BDR statistically significantly different from zero?
(d) Typically five-bedroom houses sell for much more than two-bedroom houses. Is this
consistent with your answer to…
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
- A DNA molecule is shown below. A nucleotide is represented by one of the letters {a, t, c, g}. A codon is defined to be a triplet of nucleotides. The order of the nucleotides in a codon is significant, and the nucleotides can be repeated. These codons are important in determining how DNA is transformed into protein. How many different codons are possible? codons S = sugar p = phosphate g = guanine C = cytosine a = adenine t = thymine basesarrow_forwardA computer programming team has 9 members. (a) How many ways can a group of five be chosen to work on a project? As in Example 9.5.4, since the set of people in a group is a subset of the set of people on the team, the answer is (b) Suppose five team members are women and four are men. (1) How many groups of five can be chosen that contain three women and two men? As in Example 9.5.7a, think of forming the group as a two-step process, where step 1 is to choose the women and step 2 is to choose the men. The answer is (ii) How many groups of five can be chosen that contain at least one man? As in Example 9.5.7b, consider the relationship between the set of groups that consist entirely of women and the set of groups with at least one man. This thinking leads to the conclusion that the number of groups with at least on man is (iii) How many groups of five can be chosen that contain at most three women? A group of five that contains at most three women can contain no women, one woman, two…arrow_forwardSuppose each license plate in a certain state has four letters followed by two digits. The letters I, O, Q, and U and the digits 0,1, 2, and 3 are not used. So, there are 22 letters and six digits that are used. Assume that the letters and digits can be repeated. How many license plates can be generated using this format.arrow_forward
Recommended textbooks for you
Linear Algebra: A Modern IntroductionAlgebraISBN:9781285463247Author:David PoolePublisher:Cengage Learning
Linear Algebra: A Modern Introduction
Algebra
ISBN:9781285463247
Author:David Poole
Publisher:Cengage Learning
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