Homework 3 Solutions


 Donald Gardner
 1 years ago
 Views:
Transcription
1 CS 341: Foundtions of Computer Science II Prof. Mrvin Nkym Homework 3 Solutions 1. Give NFAs with the specified numer of sttes recognizing ech of the following lnguges. In ll cses, the lphet is Σ = {,1}. () The lnguge {w Σ w ends with } with three sttes., () The lnguge {w Σ w contins the sustring 11, i.e., w = x11y for some x,y Σ } with five sttes.,1, (c) The lnguge {w Σ w contins t lest two s, or exctly two 1s} with six sttes.,1 1,1 ε (d) The lnguge {ε} with one stte. 1
2 1 (e) The lnguge 1 with three sttes. 1 ε () Show y giving n exmple tht, if M is n NFA tht recognizes lnguge C, swpping the ccept nd nonccept sttes in M doesn t necessrily yield new NFA tht recognizes C. Answer: The NFA M elow recognizes the lnguge C = {w Σ w ends with }, where Σ = {,1}., Swpping the ccept nd nonccept sttes of M gives the following NFA M :, Note tht M ccepts the string 1 C = {w w does not end with }, so M does not recognize the lnguge C. () Is the clss of lnguges recognized y NFAs closed under complement? Explin your nswer. Answer: The clss of lnguges recognized y NFAs is closed under complement, which we cn prove s follows. Suppose tht C is lnguge recognized y some NFA M, i.e., C = L(M). Since every NFA hs n equivlent DFA (Theorem 1.19), there is DFA D such tht L(D) = L(M) = C. By prolem 3 on Homework 2, we then know there is nother DFA D tht recognizes the lnguge L(D). Since 2
3 every DFA is lso n NFA, this then shows tht there is n NFA, in prticulr D, tht recognizes the lnguge C = L(D). Thus, the clss of lnguges recognized y NFAs is closed under complement. 3. Use the construction given in Theorem 1.39 to convert the following NFA N into n equivlent DFA. ε 1 2 3, Answer: Let NFA N = (Q,Σ,δ,1,F), where Q =, Σ = {,}, 1 is the strt stte, F = {2}, nd the trnsition function δ s in the digrm of N. To construct DFA M = (Q,Σ,δ,q,F ) tht is equivlent to NFA N, first we compute the εclosure of every suset of Q =. Then define Q = P(Q), so Set R Q εclosure E(R) {1} {2} {2} {3} {3} {1,3} {2,3} {2,3} Q = {, {1}, {2}, {3},, {1,3}, {2,3}, }. The strt stte of M is then E({1}) =. The set of ccept sttes of M is F = { {2},, {2,3}, }. We define the trnsitions in the DFA M s in the following digrm: 3
4 {2,3}, Note tht we left out some of the sttes (e.g., {1}) in P(Q) from our digrm of the DFA M since they re not ccessile from the strt stte. Also, we hd to dd n rc from stte to itself lelled with, so tht this stte hs n rc leving it corresponding to ech symol in the lphet Σ, which is requirement for ny DFA. The lgorithm given in the notes nd textook will lwys correctly construct n equivlent DFA from given NFA, ut we don t lwys hve to go through ll the steps of the lgorithm to otin n equivlent DFA. For exmple, on this prolem, we egin y figuring out wht sttes the NFA cn e in without reding ny symols. In this cse, this is E({1}) = since 1 is the strting stte of the NFA, nd the NFA cn jump from 1 to 2 without reding ny symols y tking the εtrnsition. Thus, we first crete DFA stte corresponding to the set : The stte is the strt stte of the DFA since this is where the NFA cn e without reding ny symols. The stte is lso n ccepting stte for the DFA since it contins 2, which is ccepting for the NFA. Now for DFA stte, determine where the NFA cn go on n from ech NFA stte within this DFA stte, nd where the NFA cn go on from ech NFA stte within this DFA stte. On n, the NFA cn go from stte 1 to stte 3; lso, the NFA cn go from stte 2 to 1, nd then it lso cn go further from 1 to 2 on the ε. So from NFA sttes 1 nd 2 on n, the NFA cn end up in sttes 1, 2, nd 3, so drw trnsition in the DFA from stte to new stte, which is n ccepting stte since it contins 2 F: 4
5 Similrly, to determine where the DFA moves on from DFA stte, determine ll the possiilities of where the NFA cn go from NFA sttes 1 nd 2 on. From stte 1, the NFA cn t go nywhere on ; lso, the NFA cn t go nywhere from stte 2 on. Thus, the NFA cn t go nywhere from sttes 2 nd 3 on, so we dd edge in the DFA from stte to new DFA stte, which is not ccepting since it contins no ccept sttes of the NFA: Now every time we dd new DFA stte, we hve to determine ll the possiilities of where the NFA cn go on n from ech NFA stte within tht DFA stte, nd where the NFA cn go on from ech NFA stte within tht DFA stte. For DFA stte, we next determine where the NFA cn go on n from ech of the NFA sttes 1, 2 nd 3. From NFA stte 1, the NFA on n cn go to NFA stte 3; from NFA stte 2, the NFA on n cn go to NFA stte 1, nd then it cn lso further jump to 2 on ε; from NFA stte 3, the NFA on n cn go to NFA stte 2. Thus, if the NFA is in sttes 1, 2 nd 3, it cn go on n to sttes 1, 2 nd 3, so we dd to the DFA n edge from to. Now we determine where the edge from DFA stte goes to. To do this, we exmine wht hppens to the NFA from sttes 1, 2 nd 3 on. If the NFA is in stte 1, then there is nowhere to go on ; if the NFA is in stte 2, then there is nowhere to go on ; if the NFA is in stte 3, then the NFA cn go to 2 or 3 on. Hence, if the NFA is in sttes 1, 2 nd 3, the NFA on cn end in sttes 2 nd 3. Thus, in the DFA, drw n edge from stte to new stte {2,3}, which is ccepting since it contins 2 F: 5
6 {2,3} Now do the sme for DFA sttes {2,3} nd. If ny new DFA sttes rise, then we need to determine the nd trnsitions out of those sttes s well. We stop once every DFA stte hs n trnsition nd trnsition out of it. Accepting sttes in the DFA re ny DFA sttes tht contin t lest one ccepting NFA stte. We eventully end up with the DFA elow s efore: {2,3}, FortheDFAstte,thererenoversionsoftheNFAcurrentlyctive, i.e., ll threds hve crshed, so the NFA cnnot proceed nd the input string will not e ccepted. However, ccording to the definition of DFA, ech stte must hve edges leving it corresponding to ech symol in the lphet Σ. Thus, we dd loop from the DFA stte ck to itself leled with Σ, which in our cse is,. 4. Give regulr expressions tht generte ech of the following lnguges. In ll cses, the lphet is Σ = {,}. 6
7 () The lnguge {w Σ w is odd}. Answer: ( )(( )( )) () The lnguge {w Σ w hs n odd numer of s}. Answer: ( ) (c) The lnguge {w w contins t lest two s, or exctly two s}. Answer: ( ) (d) The lnguge {w Σ w ends in doule letter}. (A string contins doule letter if it contins or s sustring.) Answer: ( ) ( ) (e) The lnguge {w Σ w does not end in doule letter}. Answer: ε ( ) ( ) (f) The lnguge {w Σ w contins exctly one doule letter}. For exmple, hs exctly one doule letter, ut hs two doule letters. Answer: (ε )() () (ε ) (ε )() () (ε ) 5. Suppose we define restricted version of the Jv progrmming lnguge in which vrile nmes must stisfy ll of the following conditions: A vrile nme cn only use Romn letters (i.e.,,,..., z, A, B,..., Z) or Aric numerls (i.e.,, 1, 2,..., 9); i.e., underscore nd dollr sign re not llowed. A vrile nme must strt with Romn letter:,,..., z, A, B,..., Z The length of vrile nme must e no greter thn 8. A vrile nme cnnot e keyword (e.g., if). The set of keywords is finite. Let L e the set of ll vlid vrile nmes in our restricted version of Jv. () Let L e the set of strings stisfying the first 3 conditions ove; i.e., we do not require the lst condition. Give regulr expression for L. Answer: To simplify the regulr expression, we define Then regulr expression for L is = {,,...,z,a,b,...,z} Σ 2 = {,1,2,...,9}. ( Σ 2 ε) ( Σ 2 ε). } {{ } 7 times Note tht y including the ε in ech of the lst prts, we cn generte strings tht hve length strictly less thn 8. 7
8 () Prove tht L hs regulr expression, where L is the set of strings stisfying ll four conditions. Answer: We proved in Homework 1, prolem 4(), tht L is finite. Thus, L is regulr, so it hs regulr expression. Although the prolem didn t sk for it, we cn write regulr expression for L y listing ll of the strings in L nd putting in etween ech pir of consecutive strings. This works ecuse L is finite. (c) Give DFA for the lnguge L in prt (), where the lphet Σ is the set of ll printle chrcters on computer keyord (no control chrcters), except for prentheses to void confusion. Answer: Define nd Σ 2 s in prt (), nd let Σ 3 = Σ ( Σ 2 ) e ll of the other chrcters on computer keyord except for prentheses. Then DFA for L is s follows: Σ 2 Σ Σ 2 Σ 3 Σ 3 Σ 3 Σ 3 Σ Σ 6. Define L to e the set of strings tht represent numers in modified version of Jv. The gol in this prolem is to define regulr expression nd n NFA for L. To precisely define L, let the set of digits e = {, 1, 2,..., 9}, nd define the set of signs to e Σ 2 = {+, }. Then L = L 1 L 2 L 3, where L 1 is the set of ll strings tht re deciml integer numers. Specificlly, L 1 consists of strings tht strt with n optionl sign, followed y one or more digits. Exmples of strings in L 1 re 2, +9, nd L 2 is the set of ll strings tht re flotingpoint numers tht re not in exponentil nottion. Specificlly, L 2 consists of strings tht strt with n optionl sign, followed y zero or more digits, followed y deciml point, nd end with zero or more digits, where there must e t lest one digit in the string. Exmples of strings in L 2 re , 28. nd.124. All strings in L 2 hve exctly one deciml point. L 3 is the set of ll strings tht re flotingpoint numers in exponentil nottion. Specificlly, L 3 consists of strings tht strt with string from L 1 or L 2, followed y E or e, nd end with string from L 1. Exmples of strings in L 3 re 8.1E83, +8.E5 nd 1e+31. Assume tht there is no limit on the numer of digits in string in L. Also, we do not llow for the suffixes L, l, F, f, D, d, t the end of numers to denote types (long integers, flots, nd doules). Define Σ s the lphet of ll printle chrcters on computer keyord (no control chrcters), except for prentheses to void confusion. 8
9 () Give regulr expression for L 1. Also, give n NFA nd DFA for L 1 over the lphet Σ. Answer: A regulr expression for L 1 is R 1 = (+  ε) Σ 1 where = {, 1, 2,..., 9} s previously defined. An NFA for L 1 is q 1 q 2 q 3 Define Σ 3 = Σ ( Σ 2 ) with Σ 2 = {, +}, s efore. Then DFA for L 1 is 3 Σ Σ Σ Σ 3 4 Σ Notice tht the DFA is more complicted thn the NFA. () Give regulr expression for L 2. Also, give n NFA for L 2 over the lphet Σ. Answer: A regulr expression for L 2 is R 2 = (+  ε)( Σ 1.Σ 1.Σ 1 ) Note tht the regulr expression (+  ε)σ 1.Σ 1 is not correct since it cn generte the strings., +. nd ., which re not vlid flotingpoint numers. An NFA for L 2 is r 1 r 2 r 3 r 5 r 4 9
10 (c) Give regulr expression for L 3. Also, give n NFA for L 3 over the lphet Σ. Answer: A regulr expression for L 3 is R 3 = (R 1 R 2 )(E e)r 1 where R 1 nd R 2 re defined in the previous prts. An NFA for L 3 is s 3 s 1 s 2 E, e s 4 s 5 s 6 s 7 s 8 (d) Give regulr expression for the lnguge L. Also, give n NFA for L over the lphet Σ. Answer: Note tht L = L 1 L 2 L 3, so regulr expression for L is R 4 = R 1 R 2 R 3 We cn construct n NFA for L y tking the union of the NFA s for L 1, L 2 nd L 3, s follows: 1
11 q 1 q 2 q 3 ε q ε r 1 r 2 r 3 r 5 r 4 ε s 3 s 1 s 2 E, e s 4 s 5 s 6 s 7 s 8 A simpler NFA for L is to tke the NFA for L 3 nd mke s 3 nd s 5 lso ccepting sttes in ddition to s 8. 11
Formal Languages and Automata Exam
Forml Lnguges nd Automt Exm Fculty of Computers & Informtion Deprtment: Computer Science Grde: Third Course code: CSC 34 Totl Mrk: 8 Dte: 23//2 Time: 3 hours Answer the following questions: ) Consider
More informationOne Minute To Learn Programming: Finite Automata
Gret Theoreticl Ides In Computer Science Steven Rudich CS 15251 Spring 2005 Lecture 9 Fe 8 2005 Crnegie Mellon University One Minute To Lern Progrmming: Finite Automt Let me tech you progrmming lnguge
More informationRegular Sets and Expressions
Regulr Sets nd Expressions Finite utomt re importnt in science, mthemtics, nd engineering. Engineers like them ecuse they re super models for circuits (And, since the dvent of VLSI systems sometimes finite
More informationFinite Automata. Informatics 2A: Lecture 3. John Longley. 25 September School of Informatics University of Edinburgh
Lnguges nd Automt Finite Automt Informtics 2A: Lecture 3 John Longley School of Informtics University of Edinburgh jrl@inf.ed.c.uk 25 September 2015 1 / 30 Lnguges nd Automt 1 Lnguges nd Automt Wht is
More informationFORMAL LANGUAGES, AUTOMATA AND THEORY OF COMPUTATION EXERCISES ON REGULAR LANGUAGES
FORMAL LANGUAGES, AUTOMATA AND THEORY OF COMPUTATION EXERCISES ON REGULAR LANGUAGES Introduction This compendium contins exercises out regulr lnguges for the course Forml Lnguges, Automt nd Theory of Computtion
More informationSolution to Problem Set 1
CSE 5: Introduction to the Theory o Computtion, Winter A. Hevi nd J. Mo Solution to Prolem Set Jnury, Solution to Prolem Set.4 ). L = {w w egin with nd end with }. q q q q, d). L = {w w h length t let
More informationIn the following there are presented four different kinds of simulation games for a given Büchi automaton A = :
Simultion Gmes Motivtion There re t lest two distinct purposes for which it is useful to compute simultion reltionships etween the sttes of utomt. Firstly, with the use of simultion reltions it is possile
More informationUnion, Intersection and Complement. Formal Foundations Computer Theory
Union, Intersection nd Complement FAs Union, Intersection nd Complement FAs Forml Foundtions Computer Theory Ferury 21, 2013 This hndout shows (y exmples) how to construct FAs for the union, intersection
More informationSolutions to Section 1
Solutions to Section Exercise. Show tht nd. This follows from the fct tht mx{, } nd mx{, } Exercise. Show tht = { if 0 if < 0 Tht is, the bsolute vlue function is piecewise defined function. Grph this
More informationEquations between labeled directed graphs
Equtions etween leled directed grphs Existence of solutions GrretFontelles A., Misnikov A., Ventur E. My 2013 Motivtionl prolem H 1 nd H 2 two sugroups of the free group generted y X A, F (X, A). H 1
More informationAssuming all values are initially zero, what are the values of A and B after executing this Verilog code inside an always block? C=1; A <= C; B = C;
B26 Appendix B The Bsics of Logic Design Check Yourself ALU n [Arthritic Logic Unit or (rre) Arithmetic Logic Unit] A rndomnumer genertor supplied s stndrd with ll computer systems Stn KellyBootle,
More informationExample 27.1 Draw a Venn diagram to show the relationship between counting numbers, whole numbers, integers, and rational numbers.
2 Rtionl Numbers Integers such s 5 were importnt when solving the eqution x+5 = 0. In similr wy, frctions re importnt for solving equtions like 2x = 1. Wht bout equtions like 2x + 1 = 0? Equtions of this
More information0.1 Basic Set Theory and Interval Notation
0.1 Bsic Set Theory nd Intervl Nottion 3 0.1 Bsic Set Theory nd Intervl Nottion 0.1.1 Some Bsic Set Theory Notions Like ll good Mth ooks, we egin with definition. Definition 0.1. A set is welldefined
More informationDFA Operations. Complement, Product, Union, Intersection, Difference, Equivalence and Minimization of DFAs
DFA Opertions Complement, Product, nion, Intersection, Difference, Equivlence nd inimiztion of DFAs Wednesdy, Octoer 7, 2009 eding: ipser pp. 4546, toughton 3.11 3.12 C235 nguges nd Automt Deprtment of
More informationReasoning to Solve Equations and Inequalities
Lesson4 Resoning to Solve Equtions nd Inequlities In erlier work in this unit, you modeled situtions with severl vriles nd equtions. For exmple, suppose you were given usiness plns for concert showing
More informationBayesian Updating with Continuous Priors Class 13, 18.05, Spring 2014 Jeremy Orloff and Jonathan Bloom
Byesin Updting with Continuous Priors Clss 3, 8.05, Spring 04 Jeremy Orloff nd Jonthn Bloom Lerning Gols. Understnd prmeterized fmily of distriutions s representing continuous rnge of hypotheses for the
More informationEQUATIONS OF LINES AND PLANES
EQUATIONS OF LINES AND PLANES MATH 195, SECTION 59 (VIPUL NAIK) Corresponding mteril in the ook: Section 12.5. Wht students should definitely get: Prmetric eqution of line given in pointdirection nd twopoint
More informationCS 341 Homework 1 Basic Techniques
II. Homework CS 341 Homework 1 Bsic Techniques 1. Wht re these sets? Write them using rces, comms, numerls, (for infinite sets), nd only. () ({1, 3, 5} {3, 1}) {3, 5, 7} () {{3}, {3, 5}, {{5, 7}, {7, 9}}}
More informationflex Regular Expressions and Lexical Scanning Regular Expressions and flex Examples on Alphabet A = {a,b} (Standard) Regular Expressions on Alphabet A
flex Regulr Expressions nd Lexicl Scnning Using flex to Build Scnner flex genertes lexicl scnners: progrms tht discover tokens. Tokens re the smllest meningful units of progrm (or other string). flex is
More informationAppendix D: Completing the Square and the Quadratic Formula. In Appendix A, two special cases of expanding brackets were considered:
Appendi D: Completing the Squre nd the Qudrtic Formul Fctoring qudrtic epressions such s: + 6 + 8 ws one of the topics introduced in Appendi C. Fctoring qudrtic epressions is useful skill tht cn help you
More informationWords Symbols Diagram. abcde. a + b + c + d + e
Logi Gtes nd Properties We will e using logil opertions to uild mhines tht n do rithmeti lultions. It s useful to think of these opertions s si omponents tht n e hooked together into omplex networks. To
More informationAlgebra Review. How well do you remember your algebra?
Algebr Review How well do you remember your lgebr? 1 The Order of Opertions Wht do we men when we write + 4? If we multiply we get 6 nd dding 4 gives 10. But, if we dd + 4 = 7 first, then multiply by then
More informationSquare Roots Teacher Notes
Henri Picciotto Squre Roots Techer Notes This unit is intended to help students develop n understnding of squre roots from visul / geometric point of view, nd lso to develop their numer sense round this
More informationBinary Representation of Numbers Autar Kaw
Binry Representtion of Numbers Autr Kw After reding this chpter, you should be ble to: 1. convert bse rel number to its binry representtion,. convert binry number to n equivlent bse number. In everydy
More informationBasic Math Review. Numbers. Important Properties. Absolute Value PROPERTIES OF ADDITION NATURAL NUMBERS {1, 2, 3, 4, 5, }
ƒ Bsic Mth Review Numers NATURAL NUMBERS {1,, 3, 4, 5, } WHOLE NUMBERS {0, 1,, 3, 4, } INTEGERS {, 3,, 1, 0, 1,, } The Numer Line 5 4 3 1 0 1 3 4 5 Negtive integers Positive integers RATIONAL NUMBERS All
More informationUniform convergence and its consequences
Uniform convergence nd its consequences The following issue is centrl in mthemtics: On some domin D, we hve sequence of functions {f n }. This mens tht we relly hve n uncountble set of ordinry sequences,
More informationLecture 15  Curve Fitting Techniques
Lecture 15  Curve Fitting Techniques Topics curve fitting motivtion liner regression Curve fitting  motivtion For root finding, we used given function to identify where it crossed zero where does fx
More informationQuadratic Equations  1
Alger Module A60 Qudrtic Equtions  1 Copyright This puliction The Northern Alert Institute of Technology 00. All Rights Reserved. LAST REVISED Novemer, 008 Qudrtic Equtions  1 Sttement of Prerequisite
More informationnot to be republished NCERT POLYNOMIALS CHAPTER 2 (A) Main Concepts and Results (B) Multiple Choice Questions
POLYNOMIALS (A) Min Concepts nd Results Geometricl mening of zeroes of polynomil: The zeroes of polynomil p(x) re precisely the xcoordintes of the points where the grph of y = p(x) intersects the xxis.
More information10.5 Graphing Quadratic Functions
0.5 Grphing Qudrtic Functions Now tht we cn solve qudrtic equtions, we wnt to lern how to grph the function ssocited with the qudrtic eqution. We cll this the qudrtic function. Grphs of Qudrtic Functions
More informationRegular Languages and Finite Automata
N Lecture Notes on Regulr Lnguges nd Finite Automt for Prt IA of the Computer Science Tripos Mrcelo Fiore Cmbridge University Computer Lbortory First Edition 1998. Revised 1999, 2000, 2001, 2002, 2003,
More informationSection 54 Trigonometric Functions
5 Trigonometric Functions Section 5 Trigonometric Functions Definition of the Trigonometric Functions Clcultor Evlution of Trigonometric Functions Definition of the Trigonometric Functions Alternte Form
More informationCS99S Laboratory 2 Preparation Copyright W. J. Dally 2001 October 1, 2001
CS99S Lortory 2 Preprtion Copyright W. J. Dlly 2 Octoer, 2 Ojectives:. Understnd the principle of sttic CMOS gte circuits 2. Build simple logic gtes from MOS trnsistors 3. Evlute these gtes to oserve logic
More informationSimple Electric Circuits
Simple Eletri Ciruits Gol: To uild nd oserve the opertion of simple eletri iruits nd to lern mesurement methods for eletri urrent nd voltge using mmeters nd voltmeters. L Preprtion Eletri hrges move through
More informationBasics of Logic Design: Boolean Algebra, Logic Gates. Administrative
Bsics of Logic Design: Boolen Alger, Logic Gtes Computer Science 104 Administrtive Homework #3 Due Sundy Midterm I Mondy in clss, closed ook, closed notes Ø Will provide IA32 instruction set hndout Ø Lst
More informationChapter 9: Quadratic Equations
Chpter 9: Qudrtic Equtions QUADRATIC EQUATIONS DEFINITION + + c = 0,, c re constnts (generlly integers) ROOTS Synonyms: Solutions or Zeros Cn hve 0, 1, or rel roots Consider the grph of qudrtic equtions.
More informationSuffix Trees CMSC 423
Suffix Trees CMSC 423 Preprocessing Strings Over the next few lectures, we ll see severl methods for preprocessing string dt into dt structures tht mke mny questions (like serching) esy to nswer: Suffix
More informationContent Objectives: After completing the activity, students will gain experience of informally proving Pythagoras Theorem
Pythgors Theorem S Topic 1 Level: Key Stge 3 Dimension: Mesures, Shpe nd Spce Module: Lerning Geometry through Deductive Approch Unit: Pythgors Theorem Student ility: Averge Content Ojectives: After completing
More informationAssignment 2. Solutions. Compiler Design I (Kompilatorteknik I) 2011
Assignment 2 olutions Compiler Design I Kompiltorteknik I) 2011 1 Contextfree grmmrs Give the definition of context free grmmr over the lphbet Σ = {, b} tht describes ll strings tht hve different number
More information1.2 The Integers and Rational Numbers
.2. THE INTEGERS AND RATIONAL NUMBERS.2 The Integers n Rtionl Numers The elements of the set of integers: consist of three types of numers: Z {..., 5, 4, 3, 2,, 0,, 2, 3, 4, 5,...} I. The (positive) nturl
More informationMath 135 Circles and Completing the Square Examples
Mth 135 Circles nd Completing the Squre Exmples A perfect squre is number such tht = b 2 for some rel number b. Some exmples of perfect squres re 4 = 2 2, 16 = 4 2, 169 = 13 2. We wish to hve method for
More informationPolynomial Functions. Polynomial functions in one variable can be written in expanded form as ( )
Polynomil Functions Polynomil functions in one vrible cn be written in expnded form s n n 1 n 2 2 f x = x + x + x + + x + x+ n n 1 n 2 2 1 0 Exmples of polynomils in expnded form re nd 3 8 7 4 = 5 4 +
More informationVectors 2. 1. Recap of vectors
Vectors 2. Recp of vectors Vectors re directed line segments  they cn be represented in component form or by direction nd mgnitude. We cn use trigonometry nd Pythgors theorem to switch between the forms
More informationPROF. BOYAN KOSTADINOV NEW YORK CITY COLLEGE OF TECHNOLOGY, CUNY
MAT 0630 INTERNET RESOURCES, REVIEW OF CONCEPTS AND COMMON MISTAKES PROF. BOYAN KOSTADINOV NEW YORK CITY COLLEGE OF TECHNOLOGY, CUNY Contents 1. ACT Compss Prctice Tests 1 2. Common Mistkes 2 3. Distributive
More informationMATH 150 HOMEWORK 4 SOLUTIONS
MATH 150 HOMEWORK 4 SOLUTIONS Section 1.8 Show tht the product of two of the numbers 65 1000 8 2001 + 3 177, 79 1212 9 2399 + 2 2001, nd 24 4493 5 8192 + 7 1777 is nonnegtive. Is your proof constructive
More informationSolutions for Selected Exercises from Introduction to Compiler Design
Solutions for Selected Exercises from Introduction to Compiler Design Torben Æ. Mogensen Lst updte: My 30, 2011 1 Introduction This document provides solutions for selected exercises from Introduction
More informationLiveEngage Agent Guide. Version 1.0
Agent Guide Version 1.0 Tle of Contents Contents LOGGING IN... 3 NAVIGATING LIVEENGAGE... 4 Visitor List, Connection Are, Enggement Br & Going Online... 4 ENGAGEMENT OPTIONS... 5 Tking n Enggment... 5
More informationGeneralized Inverses: How to Invert a NonInvertible Matrix
Generlized Inverses: How to Invert NonInvertible Mtrix S. Swyer September 7, 2006 rev August 6, 2008. Introduction nd Definition. Let A be generl m n mtrix. Then nturl question is when we cn solve Ax
More informationThe Math Learning Center PO Box 12929, Salem, Oregon 97309 0929 Math Learning Center
Resource Overview Quntile Mesure: Skill or Concept: 1010Q Determine perimeter using concrete models, nonstndrd units, nd stndrd units. (QT M 146) Use models to develop formuls for finding res of tringles,
More informationMATLAB: Mfiles; Numerical Integration Last revised : March, 2003
MATLAB: Mfiles; Numericl Integrtion Lst revised : Mrch, 00 Introduction to Mfiles In this tutoril we lern the bsics of working with Mfiles in MATLAB, so clled becuse they must use.m for their filenme
More informationA.7.1 Trigonometric interpretation of dot product... 324. A.7.2 Geometric interpretation of dot product... 324
A P P E N D I X A Vectors CONTENTS A.1 Scling vector................................................ 321 A.2 Unit or Direction vectors...................................... 321 A.3 Vector ddition.................................................
More informationFAULT TREES AND RELIABILITY BLOCK DIAGRAMS. Harry G. Kwatny. Department of Mechanical Engineering & Mechanics Drexel University
SYSTEM FAULT AND Hrry G. Kwtny Deprtment of Mechnicl Engineering & Mechnics Drexel University OUTLINE SYSTEM RBD Definition RBDs nd Fult Trees System Structure Structure Functions Pths nd Cutsets Reliility
More informationVariable Dry Run (for Python)
Vrile Dr Run (for Pthon) Age group: Ailities ssumed: Time: Size of group: Focus Vriles Assignment Sequencing Progrmming 7 dult Ver simple progrmming, sic understnding of ssignment nd vriles 2050 minutes
More informationSolving Linear Equations  Formulas
1. Solving Liner Equtions  Formuls Ojective: Solve liner formuls for given vrile. Solving formuls is much like solving generl liner equtions. The only difference is we will hve severl vriles in the prolem
More informationWritten Homework 6 Solutions
Written Homework 6 Solutions Section.10 0. Explin in terms of liner pproximtions or differentils why the pproximtion is resonble: 1.01) 6 1.06 Solution: First strt by finding the liner pproximtion of f
More information5.6 POSITIVE INTEGRAL EXPONENTS
54 (5 ) Chpter 5 Polynoils nd Eponents 5.6 POSITIVE INTEGRAL EXPONENTS In this section The product rule for positive integrl eponents ws presented in Section 5., nd the quotient rule ws presented in Section
More informationSirindhorn International Institute of Technology Thammasat University at Rangsit
Sirindhorn Interntionl Institute of Technology Thmmst University t Rngsit School of Informtion, Computer nd Communiction Technology COURSE : ECS 204 Bsic Electricl Engineering L INSTRUCTOR : Asst. Prof.
More informationExponentiation: Theorems, Proofs, Problems Pre/Calculus 11, Veritas Prep.
Exponentition: Theorems, Proofs, Problems Pre/Clculus, Verits Prep. Our Exponentition Theorems Theorem A: n+m = n m Theorem B: ( n ) m = nm Theorem C: (b) n = n b n ( ) n n Theorem D: = b b n Theorem E:
More informationJava CUP. Java CUP Specifications. User Code Additions You may define Java code to be included within the generated parser:
Jv CUP Jv CUP is prsergenertion tool, similr to Ycc. CUP uilds Jv prser for LALR(1) grmmrs from production rules nd ssocited Jv code frgments. When prticulr production is recognized, its ssocited code
More informationUse Geometry Expressions to create a more complex locus of points. Find evidence for equivalence using Geometry Expressions.
Lerning Objectives Loci nd Conics Lesson 3: The Ellipse Level: Preclculus Time required: 120 minutes In this lesson, students will generlize their knowledge of the circle to the ellipse. The prmetric nd
More informationMathematics Higher Level
Mthemtics Higher Level Higher Mthemtics Exmintion Section : The Exmintion Mthemtics Higher Level. Structure of the exmintion pper The Higher Mthemtics Exmintion is divided into two ppers s detiled below:
More informationModular Generic Verification of LTL Properties for Aspects
Modulr Generic Verifiction of LTL Properties for Aspects Mx Goldmn Shmuel Ktz Computer Science Deprtment Technion Isrel Institute of Technology {mgoldmn, ktz}@cs.technion.c.il ABSTRACT Aspects re seprte
More informationIntroduction to Mathematical Reasoning, Saylor 111
Frction versus rtionl number. Wht s the difference? It s not n esy question. In fct, the difference is somewht like the difference between set of words on one hnd nd sentence on the other. A symbol is
More informationJPAE Application: A StepbyStep Guide
JPAE Appliction: A StepyStep Guide Copyright 2016 2014 NCS Pte. Pte. Ltd. Ltd. All All Rights Rights Reserved. Step 1: Access JPAE You my ccess the JPAE Appliction t jpe.polytechnic.edu.sg You will e
More informationMaths Assessment Year 4: Number and Place Value
Nme: Mths Assessment Yer 4: Numer nd Plce Vlue 1. Count in multiples of 6, 7, 9, 25 nd 1 000; find 1 000 more or less thn given numer. 2. Find 1,000 more or less thn given numer. 3. Count ckwrds through
More informationMathematics. Vectors. hsn.uk.net. Higher. Contents. Vectors 128 HSN23100
hsn.uk.net Higher Mthemtics UNIT 3 OUTCOME 1 Vectors Contents Vectors 18 1 Vectors nd Sclrs 18 Components 18 3 Mgnitude 130 4 Equl Vectors 131 5 Addition nd Subtrction of Vectors 13 6 Multipliction by
More information4: RIEMANN SUMS, RIEMANN INTEGRALS, FUNDAMENTAL THEOREM OF CALCULUS
4: RIEMA SUMS, RIEMA ITEGRALS, FUDAMETAL THEOREM OF CALCULUS STEVE HEILMA Contents 1. Review 1 2. Riemnn Sums 2 3. Riemnn Integrl 3 4. Fundmentl Theorem of Clculus 7 5. Appendix: ottion 10 1. Review Theorem
More informationBinary Golomb Codes. CSE 589 Applied Algorithms Autumn Constructing a Binary Golomb Code. Example. Example. Comparison of GC with Entropy
CSE 589 pplied lgorithms utumn Golom Coding rithmetic Coding LZW Sequitur Binry Golom Codes Binry source with s much more frequent thn s. Vriletovrile length code Prefix code. Golom code of order 4 input
More informationQuadratic Equations. Math 99 N1 Chapter 8
Qudrtic Equtions Mth 99 N1 Chpter 8 1 Introduction A qudrtic eqution is n eqution where the unknown ppers rised to the second power t most. In other words, it looks for the vlues of x such tht second degree
More information4.11 Inner Product Spaces
314 CHAPTER 4 Vector Spces 9. A mtrix of the form 0 0 b c 0 d 0 0 e 0 f g 0 h 0 cnnot be invertible. 10. A mtrix of the form bc d e f ghi such tht e bd = 0 cnnot be invertible. 4.11 Inner Product Spces
More informationSearching All Seeds of Strings with Hamming Distance using Finite Automata
Proceedings of the Interntionl MultiConference of Engineers nd Computer Scientists 2009 Vol I IMECS 2009, Mrch 1820, 2009, Hong Kong Serching All Seeds of Strings with Hmming Distnce using Finite Automt
More informationAlgorithms Chapter 4 Recurrences
Algorithms Chpter 4 Recurrences Outline The substitution method The recursion tree method The mster method Instructor: Ching Chi Lin 林清池助理教授 chingchilin@gmilcom Deprtment of Computer Science nd Engineering
More informationExperiment 6: Friction
Experiment 6: Friction In previous lbs we studied Newton s lws in n idel setting, tht is, one where friction nd ir resistnce were ignored. However, from our everydy experience with motion, we know tht
More informationMultiplication and Division  Left to Right. Addition and Subtraction  Left to Right.
Order of Opertions r of Opertions Alger P lese Prenthesis  Do ll grouped opertions first. E cuse Eponents  Second M D er Multipliction nd Division  Left to Right. A unt S hniqu Addition nd Sutrction
More informationand thus, they are similar. If k = 3 then the Jordan form of both matrices is
Homework ssignment 11 Section 7. pp. 24925 Exercise 1. Let N 1 nd N 2 be nilpotent mtrices over the field F. Prove tht N 1 nd N 2 re similr if nd only if they hve the sme miniml polynomil. Solution: If
More information1. The leves re either lbeled with sentences in ;, or with sentences of the form All X re X. 2. The interior leves hve two children drwn bove them) if
Q520 Notes on Nturl Logic Lrry Moss We hve seen exmples of wht re trditionlly clled syllogisms lredy: All men re mortl. Socrtes is mn. Socrtes is mortl. The ide gin is tht the sentences bove the line should
More information11. Fourier series. sin mx cos nx dx = 0 for any m, n, sin 2 mx dx = π.
. Fourier series Summry of the bsic ides The following is quick summry of the introductory tretment of Fourier series in MATH. We consider function f with period π, tht is, stisfying f(x + π) = f(x) for
More informationSection A4 Rational Expressions: Basic Operations
A Appendi A A BASIC ALGEBRA REVIEW 7. Construction. A rectngulr opentopped bo is to be constructed out of 9 by 6inch sheets of thin crdbord by cutting inch squres out of ech corner nd bending the
More informationThe Quadratic Formula and the Discriminant
99 The Qudrtic Formul nd the Discriminnt Objectives Solve qudrtic equtions by using the Qudrtic Formul. Determine the number of solutions of qudrtic eqution by using the discriminnt. Vocbulry discriminnt
More informationBasic technologies. Lexical analysis. Lexical analysis. Basic technologies. Syntactical analysis Parser generators Rewrite engines
Bsc technologes Generc Lnguge Technology: Bsc technologes Pro.dr. Mrk vn den Brnd Syntctcl nlyss Prser genertors Rewrte engnes / Fcultet Wskunde en Inormtc 292010 PAGE 1 Tsks nd orgnzton o lexcl nlyzer
More informationIntegration by Substitution
Integrtion by Substitution Dr. Philippe B. Lvl Kennesw Stte University August, 8 Abstrct This hndout contins mteril on very importnt integrtion method clled integrtion by substitution. Substitution is
More informationLecture 3 Basic Probability and Statistics
Lecture 3 Bsic Probbility nd Sttistics The im of this lecture is to provide n extremely speedy introduction to the probbility nd sttistics which will be needed for the rest of this lecture course. The
More informationWarmup for Differential Calculus
Summer Assignment Wrmup for Differentil Clculus Who should complete this pcket? Students who hve completed Functions or Honors Functions nd will be tking Differentil Clculus in the fll of 015. Due Dte:
More informationBypassing Space Explosion in Regular Expression Matching for Network Intrusion Detection and Prevention Systems
Bypssing Spce Explosion in Regulr Expression Mtching for Network Intrusion Detection n Prevention Systems Jignesh Ptel, Alex Liu n Eric Torng Dept. of Computer Science n Engineering Michign Stte University
More informationLec 2: Gates and Logic
Lec 2: Gtes nd Logic Kvit Bl CS 34, Fll 28 Computer Science Cornell University Announcements Clss newsgroup creted Posted on wepge Use it for prtner finding First ssignment is to find prtners Due this
More informationProtocol Analysis. 17654/17764 Analysis of Software Artifacts Kevin Bierhoff
Protocol Anlysis 17654/17764 Anlysis of Softwre Artifcts Kevin Bierhoff TkeAwys Protocols define temporl ordering of events Cn often be cptured with stte mchines Protocol nlysis needs to py ttention
More informationAnswer, Key Homework 10 David McIntyre 1
Answer, Key Homework 10 Dvid McIntyre 1 This printout should hve 22 questions, check tht it is complete. Multiplechoice questions my continue on the next column or pge: find ll choices efore mking your
More informationQuick Reference Guide: Onetime Account Update
Quick Reference Guide: Onetime Account Updte How to complete The Quick Reference Guide shows wht existing SingPss users need to do when logging in to the enhnced SingPss service for the first time. 1)
More informationPentominoes. Pentominoes. Bruce Baguley Cascade Math Systems, LLC. The pentominoes are a simplelooking set of objects through which some powerful
Pentominoes Bruce Bguley Cscde Mth Systems, LLC Astrct. Pentominoes nd their reltives the polyominoes, polycues, nd polyhypercues will e used to explore nd pply vrious importnt mthemticl concepts. In this
More informationSection 2.3. Motion Along a Curve. The Calculus of Functions of Several Variables
The Clculus of Functions of Severl Vribles Section 2.3 Motion Along Curve Velocity ccelertion Consider prticle moving in spce so tht its position t time t is given by x(t. We think of x(t s moving long
More information1. Inverse of a tridiagonal matrix
PréPublicções do Deprtmento de Mtemátic Universidde de Coimbr Preprint Number 05 16 ON THE EIGENVALUES OF SOME TRIDIAGONAL MATRICES CM DA FONSECA Abstrct: A solution is given for problem on eigenvlues
More informationTests for One Poisson Mean
Chpter 412 Tests for One Poisson Men Introduction The Poisson probbility lw gives the probbility distribution of the number of events occurring in specified intervl of time or spce. The Poisson distribution
More informationThe AVL Tree Rotations Tutorial
The AVL Tree Rottions Tutoril By John Hrgrove Version 1.0.1, Updted Mr222007 Astrt I wrote this doument in n effort to over wht I onsider to e drk re of the AVL Tree onept. When presented with the tsk
More informationAntiderivatives/Indefinite Integrals of Basic Functions
Antiderivtives/Indefinite Integrls of Bsic Functions Power Rule: x n+ x n n + + C, dx = ln x + C, if n if n = In prticulr, this mens tht dx = ln x + C x nd x 0 dx = dx = dx = x + C Integrl of Constnt:
More informationI calculate the unemployment rate as (In Labor Force Employed)/In Labor Force
Introduction to the Prctice of Sttistics Fifth Edition Moore, McCbe Section 4.5 Homework Answers to 98, 99, 100,102, 103,105, 107, 109,110, 111, 112, 113 Working. In the lnguge of government sttistics,
More information9.3. The Scalar Product. Introduction. Prerequisites. Learning Outcomes
The Sclr Product 9.3 Introduction There re two kinds of multipliction involving vectors. The first is known s the sclr product or dot product. This is soclled becuse when the sclr product of two vectors
More information1.00/1.001 Introduction to Computers and Engineering Problem Solving Fall 2011  Final Exam
1./1.1 Introduction to Computers nd Engineering Problem Solving Fll 211  Finl Exm Nme: MIT Emil: TA: Section: You hve 3 hours to complete this exm. In ll questions, you should ssume tht ll necessry pckges
More informationLecture 5. Inner Product
Lecture 5 Inner Product Let us strt with the following problem. Given point P R nd line L R, how cn we find the point on the line closest to P? Answer: Drw line segment from P meeting the line in right
More informationa. Implement the function using a minimal network of 2:4 decoders and OR gates.
CSE4 Eercise Solutions I. Given threeinput Boolen function f(,, c) = m(, 2, 4, 6, 7) + d().. Implement the function using miniml network of 2:4 decoders nd OR gtes. Stndrd solution: Use s the enle signl,
More information