DISCRETE MATH
8th Edition
ISBN: 9781266712326
Author: ROSEN
Publisher: MCG CUSTOM
expand_more
expand_more
format_list_bulleted
Videos
Textbook Question
Chapter 13.3, Problem 31E
Construct a deterministic finite-state automaton that recognizes the set of all bit strings that begin and end with 11.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
In a company with 80 employees, 60 earn $10.00 per hour and 20 earn $13.00 per
hour.
Is this average hourly wage considered representative?
The following is a list of questions answered correctly on an exam. Calculate the
Measures of Central Tendency from the ungrouped data list.
NUMBER OF QUESTIONS ANSWERED CORRECTLY ON AN APTITUDE EXAM
112
72
69
97
107
73
92
76
86
73
126
128
118
127
124
82
104
132
134
83
92
108
96
100
92
115
76
91
102
81
95
141
81
80
106
84
119
113
98
75
68
98
115
106
95
100
85
94
106
119
The following ordered data list shows the data speeds for cell phones used by a
telephone company at an airport:
A. Calculate the Measures of Central Tendency using the table in point B.
B. Are there differences in the measurements obtained in A and C? Why (give at
least one justified reason)?
0.8
1.4
1.8
1.9
3.2
3.6
4.5
4.5
4.6
6.2
6.5
7.7
7.9
9.9
10.2
10.3
10.9
11.1
11.1
11.6
11.8
12.0
13.1
13.5
13.7
14.1
14.2
14.7
15.0
15.1
15.5
15.8
16.0
17.5
18.2
20.2
21.1
21.5
22.2
22.4
23.1
24.5
25.7
28.5
34.6
38.5
43.0
55.6
71.3
77.8
Chapter 13 Solutions
DISCRETE MATH
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
Additional Math Textbook Solutions
Find more solutions based on key concepts
In Exercises 9-20, use the data in the following table, which lists drive-thru order accuracy at popular fast f...
Elementary Statistics (13th Edition)
Empirical versus Theoretical A Monopoly player claims that the probability of getting a 4 when rolling a six-si...
Introductory Statistics
For each hour of class time, how many hours outside of class are recommended for studying and doing homework?
Elementary Algebra For College Students (10th Edition)
First Derivative Test a. Locale the critical points of f. b. Use the First Derivative Test to locale the local ...
Calculus: Early Transcendentals (2nd Edition)
Find all solutions of each equation in the interval .
Precalculus: A Unit Circle Approach (3rd Edition)
Complete each statement with the correct term from the column on the right. Some of the choices may not be used...
Intermediate Algebra (13th Edition)
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
- In a company with 80 employees, 60 earn $10.00 per hour and 20 earn $13.00 per hour. a) Determine the average hourly wage. b) In part a), is the same answer obtained if the 60 employees have an average wage of $10.00 per hour? Prove your answer.arrow_forward1. Estimate the area under the graph of f(x)-25-x from x=0 to x=5 using 5 approximating rectangles Using: (A) right endpoints. (B) left endpoints.arrow_forwardThe following ordered data list shows the data speeds for cell phones used by a telephone company at an airport: A. Calculate the Measures of Central Tendency from the ungrouped data list. B. Group the data in an appropriate frequency table. 0.8 1.4 1.8 1.9 3.2 3.6 4.5 4.5 4.6 6.2 6.5 7.7 7.9 9.9 10.2 10.3 10.9 11.1 11.1 11.6 11.8 12.0 13.1 13.5 13.7 14.1 14.2 14.7 15.0 15.1 15.5 15.8 16.0 17.5 18.2 20.2 21.1 21.5 22.2 22.4 23.1 24.5 25.7 28.5 34.6 38.5 43.0 55.6 71.3 77.8arrow_forward
- 9. Use fundamental theorem of calculus to find the derivative d a) *dt sin(x) b)(x)√1-2 dtarrow_forward3. Evaluate the definite integral: a) √66x²+8dx b) x dx c) f*(2e* - 2)dx d) √√9-x² e) (2-5x)dx f) cos(x)dx 8)²₁₂√4-x2 h) f7dx i) f² 6xdx j) ²₂(4x+3)dxarrow_forward2. Consider the integral √(2x+1)dx (a) Find the Riemann sum for this integral using right endpoints and n-4. (b) Find the Riemann sum for this same integral, using left endpoints and n=4arrow_forward
- 5. For the function y-x³-3x²-1, use derivatives to: (a) determine the intervals of increase and decrease. (b) determine the local (relative) maxima and minima. (e) determine the intervals of concavity. (d) determine the points of inflection. (e) sketch the graph with the above information indicated on the graph.arrow_forwardName: Tan Tong 16.5 Bonvicino - Period 5 1 Find the exact volume of a right hexagonal prism such that the base is a regular hexagon with a side length of 8 cm and whose distance between the two bases is 5 cm. Show all work. (4 pts) 83 tan 30°= Regular hexagon So length ~ 480 tango Cm Hexagon int angle =36016 8cm Angle bisec isper p bisect Side length 4 X=an 300 2 In the accompanying diagram of circle O, PA is tangent to the circle at A, PDC is a secant, diameter AEOC intersects chord BD at E, chords AB, BC, and DA are drawn, mDA = 46° and mBC is 32° more than mAB. If the radius of the circle is 8 cm, E is the midpoint of AO and the length of ED is 2 less than the length of BE, answer each of the following. Show all work. (a) marrow_forward18:36 G.C.A.2.ChordsSecantsandTa... จ 76 完成 2 In the accompanying diagram, AABC is inscribed in circle O, AP bisects BAC, PBD is tangent to circle O at B, and mZACB:m/CAB:m/ABC= 4:3:2 D B P F Find: mZABC, mBF, m/BEP, m/P, m/PBC ← 1 Őarrow_forward14:09 2/16 jmap.org 5G 66 In the accompanying diagram of circle O, diameters BD and AE, secants PAB and PDC, and chords BC and AD are drawn; mAD = 40; and mDC = 80. B E Find: mAB, m/BCD, m/BOE, m/P, m/PAD ← G.C.A.2.ChordsSecantsand Tangent s19.pdf (538 KB) + 4 保存... Xarrow_forward16:39 < 文字 15:28 |美图秀秀 保存 59% 5G 46 照片 完成 Bonvicino - Period Name: 6. A right regular hexagonal pyramid with the top removed (as shown in Diagram 1) in such a manner that the top base is parallel to the base of the pyramid resulting in what is shown in Diagram 2. A wedge (from the center) is then removed from this solid as shown in Diagram 3. 30 Diogram 1 Diegrom 2. Diagram 3. If the height of the solid in Diagrams 2 and 3 is the height of the original pyramid, the radius of the base of the pyramid is 10 cm and each lateral edge of the solid in Diagram 3 is 12 cm, find the exact volume of the solid in Diagram 3, measured in cubic meters. Show all work. (T 文字 贴纸 消除笔 涂鸦笔 边框 马赛克 去美容arrow_forwardAnswer question 4 pleasearrow_forwardarrow_back_iosSEE MORE QUESTIONSarrow_forward_ios
Recommended textbooks for you
Linear Algebra: A Modern IntroductionAlgebraISBN:9781285463247Author:David PoolePublisher:Cengage Learning
Elementary Linear Algebra (MindTap Course List)AlgebraISBN:9781305658004Author:Ron LarsonPublisher:Cengage Learning
Linear Algebra: A Modern Introduction
Algebra
ISBN:9781285463247
Author:David Poole
Publisher:Cengage Learning
Elementary Linear Algebra (MindTap Course List)
Algebra
ISBN:9781305658004
Author:Ron Larson
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