IST 4 Information and Logic
|
|
|
- Valentine Stafford
- 5 years ago
- Views:
Transcription
1 IST 4 Informtion nd Logic
2 T = tody x= hw#x out x= hw#x due mon tue wed thr 28 M1 oh 1 4 oh M1 11 oh oh 1 2 M2 18 oh oh 2 fri oh oh = office hours oh 25 oh M2 2 3 oh midterms oh Mx= MQx out 9 oh 3 T 4 oh Mx= MQx due 16 oh oh oh 5 oh oh oh
3 Lst time DNF is wy to express syntx ox using formul lger meets syntx oxes Ide: construct DNF y dding the norml terms tht correspond to the norml ssignments (f=1) m(,)
4 Lst time DNF is wy to express syntx ox using formul lger meets syntx oxes Ide: construct DNF y dding the norml terms tht correspond to the norml ssignments (f=1) m(,)
5 Lst time DNF is wy to express syntx ox using formul XOR(,) XOR(,)
6 Lst time Boolen Alger lnguge for inry mgic oxes m Cn relize the opertions of the lger cn compute ny DNF mgicl for Binry
7 HW#3, perspective:?? with 5 m-oxes?
8 Leiniz d1 d2 c 2 symol dder c s
9 When ws the first inry dder uilt? Shnnon Leiniz Boole d1 d2 c 2 symol dder c s sum crry
10 The First Digitl Adder George Stiitz, Grduted with PhD from Cornel in 1930 He worked t Bell Ls in New York In the fll of 1937 Stiitz used surplus relys, tin cn strips, flshlight uls, nd other common items to construct his "Model K" K stnds for kitchen...
11 Bell Ls Model Bell Ls Model 1 Complex Clcultor Computed with complex numers 450 relys Remote opertion... vi telegrph Drtmouth college to New York Invented the term digitl s opposed to nlog
12 Logic to Physics Clude Shnnon s
13 Shnnon Clude Elwood Shnnon ws orn in Petoskey, Michign, on April 30, The first sixteen yers of Shnnon's life were spent in Gylord, Michign
14 Shnnon Shnnon s Bckground Clude Elwood Shnnon ws orn in Petoskey, Michign, on April 30, 1916 In 1932 (16) he entered the University of Michign, where he took course tht introduced him to the work of George Boole He grduted in 1936 (20) with two chelor's degrees, one in electricl engineering nd one in mthemtics Joined MIT in 1936, received the msters in electricl engineering nd doctorte in Mthemtics, t the 1940 (24) commencement
15 Shnnon s Inspirtion Joined MIT in 1936 Shnnon Vnnevr Bush Smuel Cldwell The differentil nlyzer t MIT (1931) ws the first generl eqution solver It could hndle sixth-order differentil equtions
16 Shnnon Connection Between Boolen Clculus nd Physicl Circuits Shnnon 1938 Hitchcock Shnnon s dvisor oth MSc nd PhD mthemticin 78 yers go
17 Hitchcock Bush Sutherlnd ws fculty t Cltech from 1974 to 1978 (lso MS degree) Served s the founding chir of the CS Deprtment t Cltech Shnnon Ivn Sutherlnd 1938-
18 Bush Shnnon , MIT 1924, MIT Posted on the clss wesite Termn Buss Cumming Goodmn 1989, Stnford 1940, Stnford 1955, Stnford 1963, Stnford Bruck
19 Logic to Physics The lnguge of lines s
20
21 Boolen Clculus nd Physicl Circuits Single Lines nd Composition The lnguge of lines: A line cn hve only two possile colors: lue or red Two lines cn e composed in two possile wys In prllel: In series:
22 Boolen Clculus nd Physicl Circuits Endpoints Lines hve endpoints Compositions hve endpoints Two lines cn e composed in two possile wys In prllel:
23 Boolen Clculus nd Physicl Circuits Endpoints Lines hve endpoints Compositions hve endpoints Two lines cn e composed in two possile wys In series:
24 Boolen Clculus nd Physicl Circuits Composition In prllel: Compositions of lines cn e composed in two different wys, using their endpoints
25 Boolen Clculus nd Physicl Circuits Composition In prllel: Compositions of lines cn e composed in two different wys, using their endpoints
26 Boolen Clculus nd Physicl Circuits Composition Compositions of lines cn e composed in two different wys, using their endpoints In series:
27 Boolen Clculus nd Physicl Circuits Composition In series: Compositions of lines cn e composed in two different wys, using their endpoints
28 Boolen Clculus nd Physicl Circuits Color of Composition Wht is the color of composition? color = lue color = red???
29 Boolen Clculus nd Physicl Circuits Color of Composition Wht is the color of composition? color = lue color = red The color of composition is red if there is red pth etween the endpoints Otherwise, the color is lue
30 The two-color line composition is 0-1 Boolen lger! How cn we prove it?
31 Boolen Alger Algeric system: set of elements B, two inry opertions + nd B hs t lest two elements (0 nd 1) If the following xioms re true then it is Boolen Alger: A1. identity A2. complement A3. commuttive A4. distriutive
32 Two-Colored Line Composition nd 0-1 Boolen Alger Algeric system: set of elements B, two inry opertions + nd B hs t lest two elements (0 nd 1) Elements: 0 1
33 Two-Colored Line Composition nd 0-1 Boolen Alger Algeric system: set of elements B, two inry opertions + nd B hs t lest two elements (0 nd 1) Elements: Opertions: Compose in prllel: The color of composition is red if there is red pth etween the endpoints 0 1 Otherwise, the color is lue + Compose in series:
34 Two-Colored Line Composition nd 0-1 Boolen Alger 0 The color of the composition equls the color of The color of the composition equls the color of 1 + Compose in prllel Compose in series The color of composition is red if there is red pth etween the endpoints Otherwise, the color is lue
35 Two-Colored Line Composition nd 0-1 Boolen Alger The color of the composition is red = 1 The color of the composition is lue = 0 + Compose in prllel Compose in series The color of composition is red if there is red pth etween the endpoints. Otherwise, the color is lue
36 Two-Colored Line Composition nd 0-1 Boolen Alger By the definition of the color of composition + Compose in prllel Compose in series The color of composition is red if there is red pth etween the endpoints. Otherwise, the color is lue
37 Two-Colored Line Composition nd 0-1 Boolen Alger Two pths: nd c c c
38 Is the two-color line composition 0-1 Boolen lger?
39 circuits = lger In Shnnon s words: The lger of logic originted y George Boole, is symolic method of investigting logicl reltionships. The symols of Boolen lger dmit of two logicl interprettions. If interpreted in terms of clsses, the vriles re not limited to the two possile vlues 0 nd 1. E. V. Huntington gives the following set of postultes for symolic logic: We re now in position to demonstrte the equivlence of this clculus with certin elementry prts of the clculus of propositions.
40 Shnnon Shnnon used relys nd connected them in series-prllel circuits Rely on the edge controlled y 0-1 vrile
41 Shnnon Connection Between Boolen Clculus nd Physicl Circuits Shnnon The vlue of circuit is 1 if there is connected pth etween the endpoints Otherwise, it is The color of composition is red if there is red pth etween the endpoints Otherwise, the color is lue
42 Rely Circuits nlysis nd synthesis s
43 Shnnon Connection Between Boolen Clculus nd Physicl Circuits Shnnon 1938 No mention of computers... they did not exist A concept tht is missing in the text?
44 In Shnnon s words: nlysis of circuits..ny circuit is represented y set of equtions, The terms of the equtions corresponding to the vrious relys nd switches in the circuit. A clculus is developed for mnipulting these equtions y simple mthemticl processes most of which re similr to ordinry lgeric lgorisms. This clculus is shown to e exctly nlogous to the clculus of propositions used in the symolic study of logic.
45 In Shnnon s words: synthesis of circuits For the synthesis prolem the desired chrcteristics re first written s system of equtions, nd the equtions re then mnipulted into the form representing the simplest circuit. The circuit my then e immeditely drwn from the equtions. desired chrcteristic system of equtions simplified set of equtions simple circuit
46 In Shnnon s words: synthesis of circuits For the synthesis prolem the desired chrcteristics re first written s system of equtions, nd the equtions re then mnipulted into the form representing the simplest circuit. The circuit my then e immeditely drwn from the equtions. desired chrcteristic The lnguge of system of equtions Logic Design is orn! simplified set of equtions simple circuit
47 Rely Circuits nlysis
48 A rely circuit corresponds to formul rely circuits Boolen functions Boolen sum of ll the pths etween endpoints
49 Anlysis of Rely Circuits Exmple 1: - series-prllel - independent pths etween endpoints d c e c d e
50 Exmple 1: - series-prllel - independent pths etween endpoints d e c e c d
51 Exmple 1: - series-prllel - independent pths etween endpoints d e c e c d
52 Exmple 1: - series-prllel - independent pths etween endpoints d e c e c d
53 Exmple 1: - series-prllel - independent pths etween endpoints d e c e c d
54 Anlysis of Rely Circuits Exmple 2: - non series-prllel - dependent pths etween endpoints c d e
55 Anlysis of Rely Circuits c d e
56 Anlysis of Rely Circuits c d e
57 Anlysis of Rely Circuits c d e
58 Anlysis of Rely Circuits c d e
59 Anlysis of Rely Circuits Exmple 3: multiple terminls (lso in HW#4) How mny functions? c d e
60 Anlysis of Rely Circuits Exmple 3: multiple terminls (lso in HW#4) c d e
61 Anlysis of Rely Circuits Exmple 3: multiple terminls (lso in HW#4) c d e
62 Anlysis of Rely Circuits Exmple 3: multiple terminls (lso in HW#4) c d e
63 Anlysis of Rely Circuits Exmple 3: multiple terminls (lso in HW#4) c d e
64 Anlysis of Rely Circuits Exmple 3: multiple terminls (lso in HW#4) c d e
65 Anlysis of Rely Circuits Exmple 3: multiple terminls (lso in HW#4) c d e
66 Anlysis of Rely Circuits Exmple 3: multiple terminls (lso in HW#4) c d e
67 Exmple 3: 6 functions multiple terminls c d e
68 Anlysis of Rely Circuits Exmple 4: - series-prllel - MANY dependent pths etween endpoints Q: how mny FORWARD pths?
69 Anlysis of Rely Circuits Exmple 4: - series-prllel - MANY dependent pths etween endpoints Q: how mny FORWARD pths? 3X3X3X3 =81
70 Anlysis of Rely Circuits Exmple 4: - series-prllel - MANY dependent pths etween endpoints Red = vrile Blue = complement of d c c d e
71 Anlysis of Rely Circuits Exmple 4: - series-prllel - MANY dependent pths etween endpoints Red = vrile Blue = complement of d c c d e Q: Is (=0, =1, c=1, d=1, e=1) stisfying ssignment? NO
72 Anlysis of Rely Circuits Exmple 4: - series-prllel - MANY dependent pths etween endpoints Red = vrile Blue = complement of d c c d e Q: Is (=1, =1, c=1, d=1, e=1) stisfying ssignment? YES
73 Anlysis of Rely Circuits Is there stisfying ssignment?
74 Anlysis of Rely Circuits Exmple 5: - series-prllel - MANY dependent pths etween endpoints Red = vrile Blue = complement of c c Q: Is there stisfying ssignment?? NO
75 Anlysis of Rely Circuits Exmple 5: - series-prllel - MANY dependent pths etween endpoints Red = vrile Blue = complement of c c Q: Is there stisfying ssignment? must e 1
76 Anlysis of Rely Circuits Exmple 5: - series-prllel - MANY dependent pths etween endpoints Red = vrile Blue = complement of c c Q: Is there stisfying ssignment? must e 0 Contrdiction!
77 Efficient lgorizms? Questions on stisfying ssignments? The SAT prolem Is given ssignment stisfying? Is there stisfying ssignment?
78 There is n efficient lgorizm for verifying given SAT solution for ny structure! d c c d e It is relted to lgorizms for solving connectivity prolems grphs
79 Algorizms for finding SAT ssignment? c c If the circuit hs width 2: There is n efficient lgorizm for finding stisfying ssignment...
80 However, if the circuit hs width 3: No efficient lgorizm is known! Likely, n efficient lgorizm does not exist d c c d e
81 Efficient lgorizms? Questions on stisfying (SAT) ssignments? Is given ssignment stisfying? Is there stisfying ssignment? Shnnon s connection etween computtion nd Boolen lger is t the core of Algorithms nd Complexity! P vs NP question
82 Wht is the function?
83 Wht Anlysis is the of Rely function? Circuits Red = vrile Blue = complement of c c d c d c
84 Wht Anlysis is the of Rely function? Circuits The key: 1 - switch etween low nd high 0 - sty t the sme level Red = vrile Blue = complement of c d odd prity c d c even prity
85 Wht Anlysis is the of Rely function? Circuits The key: 1 - switch etween low nd high 0 - sty t the sme level odd prity =1 d=1 =1 c=0 even prity
86 Wht Anlysis is the of Rely function? Circuits The key: 1 - switch etween low nd high 0 - sty t the sme level Red = vrile Blue = complement of odd prity even prity
87 Rely Circuits teching the next genertion
88
89 The First Book on Switching Circuits Keister, Ritchie nd Wshurn, Willim Keister
90 SpinOut Keister Willim Keister Willim Keister ws pioneer in switching theory nd design t Bell Ls Keister egn working in his spre time to prove tht puzzles could e solved using Boolen lger U.S. Ptent (1972): SpinOut U.S. Ptent (1972): The Hexdeciml Puzzle
91 The First Book on Switching Circuits Keister, Ritchie nd Wshurn, 1951 C nd Unix Dennis Ritchie Son of
92 The First Book on Switching Circuits Keister, Ritchie nd Wshurn, 1951 Being recognized y the president with co-inventor Ken Thompson C nd Unix Dennis Ritchie Son of
93 The First Book on Switching Circuits Keister, Ritchie nd Wshurn, 1951
94 Importnt note Shnnon Used the Dul Nottion In this HW set use the nottion from clss! 1 = closed rely/circuit 0 = open rely/circuit
95
96
97 One circuit with multiple terminls for mny functions
98 One circuit with multiple terminls for mny functions
99 Wit until fter the clss on Thursdy...
100 Wit until fter the clss on Thursdy...
IST 4 Information and Logic
IST 4 Informtion nd Logic T = tody x= hw#x out x= hw#x due mon tue wed thr fri 31 M1 1 7 oh M1 14 oh 1 oh 2M2 21 oh oh 2 oh Mx= MQx out Mx= MQx due 28 oh M2 oh oh = office hours 5 3 12 oh 3 T 4 oh oh 19
IST 4 Information and Logic
IST 4 Informtion nd Logic mon tue wed thr fri sun T = tody 3 M1 oh 1 x= hw#x out 10 oh M1 17 oh oh 1 2 M2 oh oh x= hw#x due 24 oh oh 2 oh = office hours oh 1 oh M2 8 3 oh midterms oh oh Mx= MQx out 15
Boolean algebra.
http://en.wikipedi.org/wiki/elementry_boolen_lger Boolen lger www.tudorgir.com Computer science is not out computers, it is out computtion nd informtion. computtion informtion computer informtion Turing
CS12N: The Coming Revolution in Computer Architecture Laboratory 2 Preparation
CS2N: The Coming Revolution in Computer Architecture Lortory 2 Preprtion Ojectives:. Understnd the principle of sttic CMOS gte circuits 2. Build simple logic gtes from MOS trnsistors 3. Evlute these gtes
Boolean Algebra. Boolean Algebra
Boolen Alger Boolen Alger A Boolen lger is set B of vlues together with: - two inry opertions, commonly denoted y + nd, - unry opertion, usully denoted y ˉ or ~ or, - two elements usully clled zero nd
8. Complex Numbers. We can combine the real numbers with this new imaginary number to form the complex numbers.
8. Complex Numers The rel numer system is dequte for solving mny mthemticl prolems. But it is necessry to extend the rel numer system to solve numer of importnt prolems. Complex numers do not chnge the
Intermediate Math Circles Wednesday, November 14, 2018 Finite Automata II. Nickolas Rollick a b b. a b 4
Intermedite Mth Circles Wednesdy, Novemer 14, 2018 Finite Automt II Nickols Rollick nrollick@uwterloo.c Regulr Lnguges Lst time, we were introduced to the ide of DFA (deterministic finite utomton), one
Overview of Today s Lecture:
CPS 4 Computer Orgniztion nd Progrmming Lecture : Boolen Alger & gtes. Roert Wgner CPS4 BA. RW Fll 2 Overview of Tody s Lecture: Truth tles, Boolen functions, Gtes nd Circuits Krnugh mps for simplifying
IST 4 Information and Logic
IST 4 Information and Logic T = today x= hw#x out x= hw#x due mon tue wed thr fri 31 M1 1 7 oh M1 14 oh 1 oh 2M2 21 oh oh 2 oh Mx= MQx out 28 oh M2 oh oh = office hours 5 3 12 oh 3 4 oh oh T midterms oh
Combinational Logic. Precedence. Quick Quiz 25/9/12. Schematics à Boolean Expression. 3 Representations of Logic Functions. Dr. Hayden So.
5/9/ Comintionl Logic ENGG05 st Semester, 0 Dr. Hyden So Representtions of Logic Functions Recll tht ny complex logic function cn e expressed in wys: Truth Tle, Boolen Expression, Schemtics Only Truth
First Midterm Examination
Çnky University Deprtment of Computer Engineering 203-204 Fll Semester First Midterm Exmintion ) Design DFA for ll strings over the lphet Σ = {,, c} in which there is no, no nd no cc. 2) Wht lnguge does
DATABASE DESIGN I - 1DL300
DATABASE DESIGN I - DL300 Fll 00 An introductory course on dtse systems http://www.it.uu.se/edu/course/homepge/dstekn/ht0/ Mnivskn Sesn Uppsl Dtse Lortory Deprtment of Informtion Technology, Uppsl University,
M A T H F A L L CORRECTION. Algebra I 2 1 / 0 9 / U N I V E R S I T Y O F T O R O N T O
M A T H 2 4 0 F A L L 2 0 1 4 HOMEWORK ASSIGNMENT #1 CORRECTION Alger I 2 1 / 0 9 / 2 0 1 4 U N I V E R S I T Y O F T O R O N T O 1. Suppose nd re nonzero elements of field F. Using only the field xioms,
expression simply by forming an OR of the ANDs of all input variables for which the output is
2.4 Logic Minimiztion nd Krnugh Mps As we found ove, given truth tle, it is lwys possile to write down correct logic expression simply y forming n OR of the ANDs of ll input vriles for which the output
Chapter 8.2: The Integral
Chpter 8.: The Integrl You cn think of Clculus s doule-wide triler. In one width of it lives differentil clculus. In the other hlf lives wht is clled integrl clculus. We hve lredy eplored few rooms in
First Midterm Examination
24-25 Fll Semester First Midterm Exmintion ) Give the stte digrm of DFA tht recognizes the lnguge A over lphet Σ = {, } where A = {w w contins or } 2) The following DFA recognizes the lnguge B over lphet
Coalgebra, Lecture 15: Equations for Deterministic Automata
Colger, Lecture 15: Equtions for Deterministic Automt Julin Slmnc (nd Jurrin Rot) Decemer 19, 2016 In this lecture, we will study the concept of equtions for deterministic utomt. The notes re self contined
ELECTRICAL AND COMPUTER ENGINEERING DEPARTMENT, OAKLAND UNIVERSITY ECE-378: Computer Hardware Design Winter Notes - Unit 1
ELETRIL ND OMPUTER ENGINEERING DEPRTMENT, OKLND UNIVERSIT EE-78: omputer Hrdwre Design Winter 016 INTRODUTION TO LOGI IRUITS Notes - Unit 1 OOLEN LGER This is the oundtion or designing nd nlyzing digitl
CS 310 (sec 20) - Winter Final Exam (solutions) SOLUTIONS
CS 310 (sec 20) - Winter 2003 - Finl Exm (solutions) SOLUTIONS 1. (Logic) Use truth tles to prove the following logicl equivlences: () p q (p p) (q q) () p q (p q) (p q) () p q p q p p q q (q q) (p p)
Elements of Computing Systems, Nisan & Schocken, MIT Press. Boolean Logic
Elements of Computing Systems, Nisn & Schocken, MIT Press www.idc.c.il/tecs Usge nd Copyright Notice: Boolen Logic Copyright 2005 Nom Nisn nd Shimon Schocken This presenttion contins lecture mterils tht
ELECTRICAL AND COMPUTER ENGINEERING DEPARTMENT, OAKLAND UNIVERSITY ECE-2700: Digital Logic Design Fall Notes - Unit 1
INTRODUTION TO LOGI IRUITS Notes - Unit 1 OOLEN LGER This is the oundtion or designing nd nlyzing digitl systems. It dels with the cse where vriles ssume only one o two vlues: TRUE (usully represented
Analytically, vectors will be represented by lowercase bold-face Latin letters, e.g. a, r, q.
1.1 Vector Alger 1.1.1 Sclrs A physicl quntity which is completely descried y single rel numer is clled sclr. Physiclly, it is something which hs mgnitude, nd is completely descried y this mgnitude. Exmples
Reasoning and programming. Lecture 5: Invariants and Logic. Boolean expressions. Reasoning. Examples
Chir of Softwre Engineering Resoning nd progrmming Einführung in die Progrmmierung Introduction to Progrmming Prof. Dr. Bertrnd Meyer Octoer 2006 Ferury 2007 Lecture 5: Invrints nd Logic Logic is the sis
Fast Boolean Algebra
Fst Boolen Alger ELEC 267 notes with the overurden removed A fst wy to lern enough to get the prel done honorly Printed; 3//5 Slide Modified; Jnury 3, 25 John Knight Digitl Circuits p. Fst Boolen Alger
The practical version
Roerto s Notes on Integrl Clculus Chpter 4: Definite integrls nd the FTC Section 7 The Fundmentl Theorem of Clculus: The prcticl version Wht you need to know lredy: The theoreticl version of the FTC. Wht
12.1 Nondeterminism Nondeterministic Finite Automata. a a b ε. CS125 Lecture 12 Fall 2014
CS125 Lecture 12 Fll 2014 12.1 Nondeterminism The ide of nondeterministic computtions is to llow our lgorithms to mke guesses, nd only require tht they ccept when the guesses re correct. For exmple, simple
The area under the graph of f and above the x-axis between a and b is denoted by. f(x) dx. π O
1 Section 5. The Definite Integrl Suppose tht function f is continuous nd positive over n intervl [, ]. y = f(x) x The re under the grph of f nd ove the x-xis etween nd is denoted y f(x) dx nd clled the
Vectors , (0,0). 5. A vector is commonly denoted by putting an arrow above its symbol, as in the picture above. Here are some 3-dimensional vectors:
Vectors 1-23-2018 I ll look t vectors from n lgeric point of view nd geometric point of view. Algericlly, vector is n ordered list of (usully) rel numers. Here re some 2-dimensionl vectors: (2, 3), ( )
Introduction to Electrical & Electronic Engineering ENGG1203
Introduction to Electricl & Electronic Engineering ENGG23 2 nd Semester, 27-8 Dr. Hden Kwok-H So Deprtment of Electricl nd Electronic Engineering Astrction DIGITAL LOGIC 2 Digitl Astrction n Astrct ll
I1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3
2 The Prllel Circuit Electric Circuits: Figure 2- elow show ttery nd multiple resistors rrnged in prllel. Ech resistor receives portion of the current from the ttery sed on its resistnce. The split is
332:221 Principles of Electrical Engineering I Fall Hourly Exam 2 November 6, 2006
2:221 Principles of Electricl Engineering I Fll 2006 Nme of the student nd ID numer: Hourly Exm 2 Novemer 6, 2006 This is closed-ook closed-notes exm. Do ll your work on these sheets. If more spce is required,
Green s function. Green s function. Green s function. Green s function. Green s function. Green s functions. Classical case (recall)
Green s functions 3. G(t, τ) nd its derivtives G (k) t (t, τ), (k =,..., n 2) re continuous in the squre t, τ t with respect to both vribles, George Green (4 July 793 3 My 84) In 828 Green privtely published
Section 6.1 INTRO to LAPLACE TRANSFORMS
Section 6. INTRO to LAPLACE TRANSFORMS Key terms: Improper Integrl; diverge, converge A A f(t)dt lim f(t)dt Piecewise Continuous Function; jump discontinuity Function of Exponentil Order Lplce Trnsform
Chapter 1: Boolean Logic
Elements of Computing Systems, Nisn & Schocken, MIT Press, 2005 www.idc.c.il/tecs Chpter 1: Boolen Logic Usge nd Copyright Notice: Copyright 2005 Nom Nisn nd Shimon Schocken This presenttion contins lecture
Farey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University
U.U.D.M. Project Report 07:4 Frey Frctions Rickrd Fernström Exmensrete i mtemtik, 5 hp Hledre: Andres Strömergsson Exmintor: Jörgen Östensson Juni 07 Deprtment of Mthemtics Uppsl University Frey Frctions
CS 275 Automata and Formal Language Theory
CS 275 utomt nd Forml Lnguge Theory Course Notes Prt II: The Recognition Prolem (II) Chpter II.5.: Properties of Context Free Grmmrs (14) nton Setzer (Bsed on ook drft y J. V. Tucker nd K. Stephenson)
CS 330 Formal Methods and Models
CS 330 Forml Methods nd Models Dn Richrds, George Mson University, Spring 2017 Quiz Solutions Quiz 1, Propositionl Logic Dte: Ferury 2 1. Prove ((( p q) q) p) is tutology () (3pts) y truth tle. p q p q
Review of Gaussian Quadrature method
Review of Gussin Qudrture method Nsser M. Asi Spring 006 compiled on Sundy Decemer 1, 017 t 09:1 PM 1 The prolem To find numericl vlue for the integrl of rel vlued function of rel vrile over specific rnge
CS415 Compilers. Lexical Analysis and. These slides are based on slides copyrighted by Keith Cooper, Ken Kennedy & Linda Torczon at Rice University
CS415 Compilers Lexicl Anlysis nd These slides re sed on slides copyrighted y Keith Cooper, Ken Kennedy & Lind Torczon t Rice University First Progrmming Project Instruction Scheduling Project hs een posted
Exploring parametric representation with the TI-84 Plus CE graphing calculator
Exploring prmetric representtion with the TI-84 Plus CE grphing clcultor Richrd Prr Executive Director Rice University School Mthemtics Project rprr@rice.edu Alice Fisher Director of Director of Technology
CS 301. Lecture 04 Regular Expressions. Stephen Checkoway. January 29, 2018
CS 301 Lecture 04 Regulr Expressions Stephen Checkowy Jnury 29, 2018 1 / 35 Review from lst time NFA N = (Q, Σ, δ, q 0, F ) where δ Q Σ P (Q) mps stte nd n lphet symol (or ) to set of sttes We run n NFA
Lecture 2 : Propositions DRAFT
CS/Mth 240: Introduction to Discrete Mthemtics 1/20/2010 Lecture 2 : Propositions Instructor: Dieter vn Melkeeek Scrie: Dlior Zelený DRAFT Lst time we nlyzed vrious mze solving lgorithms in order to illustrte
1B40 Practical Skills
B40 Prcticl Skills Comining uncertinties from severl quntities error propgtion We usully encounter situtions where the result of n experiment is given in terms of two (or more) quntities. We then need
DATABASTEKNIK - 1DL116
DATABASTEKNIK - DL6 Spring 004 An introductury course on dtse systems http://user.it.uu.se/~udl/dt-vt004/ Kjell Orsorn Uppsl Dtse Lortory Deprtment of Informtion Technology, Uppsl University, Uppsl, Sweden
CS 373, Spring Solutions to Mock midterm 1 (Based on first midterm in CS 273, Fall 2008.)
CS 373, Spring 29. Solutions to Mock midterm (sed on first midterm in CS 273, Fll 28.) Prolem : Short nswer (8 points) The nswers to these prolems should e short nd not complicted. () If n NF M ccepts
u( t) + K 2 ( ) = 1 t > 0 Analyzing Damped Oscillations Problem (Meador, example 2-18, pp 44-48): Determine the equation of the following graph.
nlyzing Dmped Oscilltions Prolem (Medor, exmple 2-18, pp 44-48): Determine the eqution of the following grph. The eqution is ssumed to e of the following form f ( t) = K 1 u( t) + K 2 e!"t sin (#t + $
Fachgebiet Rechnersysteme1. 1. Boolean Algebra. 1. Boolean Algebra. Verification Technology. Content. 1.1 Boolean algebra basics (recap)
. Boolen Alger Fchgeiet Rechnersysteme. Boolen Alger Veriiction Technology Content. Boolen lger sics (recp).2 Resoning out Boolen expressions . Boolen Alger 2 The prolem o logic veriiction: Show tht two
Properties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives
Block #6: Properties of Integrls, Indefinite Integrls Gols: Definition of the Definite Integrl Integrl Clcultions using Antiderivtives Properties of Integrls The Indefinite Integrl 1 Riemnn Sums - 1 Riemnn
New Expansion and Infinite Series
Interntionl Mthemticl Forum, Vol. 9, 204, no. 22, 06-073 HIKARI Ltd, www.m-hikri.com http://dx.doi.org/0.2988/imf.204.4502 New Expnsion nd Infinite Series Diyun Zhng College of Computer Nnjing University
4.1. Probability Density Functions
STT 1 4.1-4. 4.1. Proility Density Functions Ojectives. Continuous rndom vrile - vers - discrete rndom vrile. Proility density function. Uniform distriution nd its properties. Expected vlue nd vrince of
Lecture 3. In this lecture, we will discuss algorithms for solving systems of linear equations.
Lecture 3 3 Solving liner equtions In this lecture we will discuss lgorithms for solving systems of liner equtions Multiplictive identity Let us restrict ourselves to considering squre mtrices since one
IST 4 Information and Logic
IST 4 Information and Logic mon tue wed thr fri sun T = today 3 M oh x= hw#x out oh M 7 oh oh 2 M2 oh oh x= hw#x due 24 oh oh 2 oh = office hours oh oh M2 8 3 oh midterms oh oh Mx= MQx out 5 oh 3 4 oh
Linear Inequalities. Work Sheet 1
Work Sheet 1 Liner Inequlities Rent--Hep, cr rentl compny,chrges $ 15 per week plus $ 0.0 per mile to rent one of their crs. Suppose you re limited y how much money you cn spend for the week : You cn spend
Lecture 09: Myhill-Nerode Theorem
CS 373: Theory of Computtion Mdhusudn Prthsrthy Lecture 09: Myhill-Nerode Theorem 16 Ferury 2010 In this lecture, we will see tht every lnguge hs unique miniml DFA We will see this fct from two perspectives
The Fundamental Theorem of Algebra
The Fundmentl Theorem of Alger Jeremy J. Fries In prtil fulfillment of the requirements for the Mster of Arts in Teching with Speciliztion in the Teching of Middle Level Mthemtics in the Deprtment of Mthemtics.
CHAPTER 1 Regular Languages. Contents. definitions, examples, designing, regular operations. Non-deterministic Finite Automata (NFA)
Finite Automt (FA or DFA) CHAPTER Regulr Lnguges Contents definitions, exmples, designing, regulr opertions Non-deterministic Finite Automt (NFA) definitions, equivlence of NFAs DFAs, closure under regulr
Bases for Vector Spaces
Bses for Vector Spces 2-26-25 A set is independent if, roughly speking, there is no redundncy in the set: You cn t uild ny vector in the set s liner comintion of the others A set spns if you cn uild everything
Linear Algebra Introduction
Introdution Wht is Liner Alger out? Liner Alger is rnh of mthemtis whih emerged yers k nd ws one of the pioneer rnhes of mthemtis Though, initilly it strted with solving of the simple liner eqution x +
Lecture 3. Introduction digital logic. Notes. Notes. Notes. Representations. February Bern University of Applied Sciences.
Lecture 3 Ferury 6 ern University of pplied ciences ev. f57fc 3. We hve seen tht circuit cn hve multiple (n) inputs, e.g.,, C, We hve lso seen tht circuit cn hve multiple (m) outputs, e.g. X, Y,, ; or
Homework 4. 0 ε 0. (00) ε 0 ε 0 (00) (11) CS 341: Foundations of Computer Science II Prof. Marvin Nakayama
CS 341: Foundtions of Computer Science II Prof. Mrvin Nkym Homework 4 1. UsetheproceduredescriedinLemm1.55toconverttheregulrexpression(((00) (11)) 01) into n NFA. Answer: 0 0 1 1 00 0 0 11 1 1 01 0 1 (00)
September 13 Homework Solutions
College of Engineering nd Computer Science Mechnicl Engineering Deprtment Mechnicl Engineering 5A Seminr in Engineering Anlysis Fll Ticket: 5966 Instructor: Lrry Cretto Septemer Homework Solutions. Are
Digital Control of Electric Drives
igitl Control o Electric rives Logic Circuits - Comintionl Boolen Alger, escription Form Czech Technicl University in Prgue Fculty o Electricl Engineering Ver.. J. Zdenek Logic Comintionl Circuit Logic
Ehrenfeucht-Fraïssé Games: Applications and Complexity. Department of Mathematics and Computer Science University of Udine, Italy ESSLLI 2010 CPH
Ehrenfeucht-Frïssé Gmes: Applictions nd Complexity Angelo Montnri Nicol Vitcolonn Deprtment of Mthemtics nd Computer Science University of Udine, Itly ESSLLI 2010 CPH Outline Introduction to EF-gmes Inexpressivity
Designing Information Devices and Systems I Fall 2016 Babak Ayazifar, Vladimir Stojanovic Homework 6. This homework is due October 11, 2016, at Noon.
EECS 16A Designing Informtion Devices nd Systems I Fll 2016 Bk Ayzifr, Vldimir Stojnovic Homework 6 This homework is due Octoer 11, 2016, t Noon. 1. Homework process nd study group Who else did you work
arxiv:math/ v2 [math.ho] 16 Dec 2003
![arxiv:math/ v2 [math.ho] 16 Dec 2003](/thumbs/92/109668180.jpg "arxiv:math/ v2 [math.ho] 16 Dec 2003")
rxiv:mth/0312293v2 [mth.ho] 16 Dec 2003 Clssicl Lebesgue Integrtion Theorems for the Riemnn Integrl Josh Isrlowitz 244 Ridge Rd. Rutherford, NJ 07070 jbi2@njit.edu Februry 1, 2008 Abstrct In this pper,
1. For each of the following theorems, give a two or three sentence sketch of how the proof goes or why it is not true.
York University CSE 2 Unit 3. DFA Clsses Converting etween DFA, NFA, Regulr Expressions, nd Extended Regulr Expressions Instructor: Jeff Edmonds Don t chet y looking t these nswers premturely.. For ech
Propositional models. Historical models of computation. Application: binary addition. Boolean functions. Implementation using switches.
Propositionl models Historil models of omputtion Steven Lindell Hverford College USA 1/22/2010 ISLA 2010 1 Strt with fixed numer of oolen vriles lled the voulry: e.g.,,. Eh oolen vrile represents proposition,
Nondeterminism and Nodeterministic Automata
Nondeterminism nd Nodeterministic Automt 61 Nondeterminism nd Nondeterministic Automt The computtionl mchine models tht we lerned in the clss re deterministic in the sense tht the next move is uniquely
IST 4 Information and Logic
IST 4 Information and Logic mon tue wed thr fri sun T = today 3 M oh x= hw#x out 0 oh M 7 oh oh 2 M2 oh oh x= hw#x due 24 oh oh 2 oh = office hours oh oh M2 8 3 oh midterms oh oh Mx= MQx out 5 oh 3 4 oh
Definite Integrals. The area under a curve can be approximated by adding up the areas of rectangles = 1 1 +
Definite Integrls --5 The re under curve cn e pproximted y dding up the res of rectngles. Exmple. Approximte the re under y = from x = to x = using equl suintervls nd + x evluting the function t the left-hnd
Harvard University Computer Science 121 Midterm October 23, 2012
Hrvrd University Computer Science 121 Midterm Octoer 23, 2012 This is closed-ook exmintion. You my use ny result from lecture, Sipser, prolem sets, or section, s long s you quote it clerly. The lphet is
Lecture 3: Equivalence Relations
Mthcmp Crsh Course Instructor: Pdric Brtlett Lecture 3: Equivlence Reltions Week 1 Mthcmp 2014 In our lst three tlks of this clss, we shift the focus of our tlks from proof techniques to proof concepts
STRAND J: TRANSFORMATIONS, VECTORS and MATRICES
Mthemtics SKE: STRN J STRN J: TRNSFORMTIONS, VETORS nd MTRIES J3 Vectors Text ontents Section J3.1 Vectors nd Sclrs * J3. Vectors nd Geometry Mthemtics SKE: STRN J J3 Vectors J3.1 Vectors nd Sclrs Vectors
EECS 141 Due 04/19/02, 5pm, in 558 Cory
UIVERSITY OF CALIFORIA College of Engineering Deprtment of Electricl Engineering nd Computer Sciences Lst modified on April 8, 2002 y Tufn Krlr (tufn@eecs.erkeley.edu) Jn M. Rey, Andrei Vldemirescu Homework
CM10196 Topic 4: Functions and Relations
CM096 Topic 4: Functions nd Reltions Guy McCusker W. Functions nd reltions Perhps the most widely used notion in ll of mthemtics is tht of function. Informlly, function is n opertion which tkes n input
Rudimentary Matrix Algebra
Rudimentry Mtrix Alger Mrk Sullivn Decemer 4, 217 i Contents 1 Preliminries 1 1.1 Why does this document exist?.................... 1 1.2 Why does nyone cre out mtrices?................ 1 1.3 Wht is mtrix?...........................
0.1 THE REAL NUMBER LINE AND ORDER
6000_000.qd //0 :6 AM Pge 0-0- CHAPTER 0 A Preclculus Review 0. THE REAL NUMBER LINE AND ORDER Represent, clssify, nd order rel numers. Use inequlities to represent sets of rel numers. Solve inequlities.
Scanner. Specifying patterns. Specifying patterns. Operations on languages. A scanner must recognize the units of syntax Some parts are easy:
Scnner Specifying ptterns source code tokens scnner prser IR A scnner must recognize the units of syntx Some prts re esy: errors mps chrcters into tokens the sic unit of syntx x = x + y; ecomes
4 VECTORS. 4.0 Introduction. Objectives. Activity 1
4 VECTRS Chpter 4 Vectors jectives fter studying this chpter you should understnd the difference etween vectors nd sclrs; e le to find the mgnitude nd direction of vector; e le to dd vectors, nd multiply
SCHOOL OF ENGINEERING & BUILT ENVIRONMENT
SCHOOL OF ENGINEERING & BUIL ENVIRONMEN MARICES FOR ENGINEERING Dr Clum Mcdonld Contents Introduction Definitions Wht is mtri? Rows nd columns of mtri Order of mtri Element of mtri Equlity of mtrices Opertions
Note 12. Introduction to Digital Control Systems
Note Introduction to Digitl Control Systems Deprtment of Mechnicl Engineering, University Of Ssktchewn, 57 Cmpus Drive, Ssktoon, SK S7N 5A9, Cnd . Introduction A digitl control system is one in which the
MORE FUNCTION GRAPHING; OPTIMIZATION. (Last edited October 28, 2013 at 11:09pm.)
MORE FUNCTION GRAPHING; OPTIMIZATION FRI, OCT 25, 203 (Lst edited October 28, 203 t :09pm.) Exercise. Let n be n rbitrry positive integer. Give n exmple of function with exctly n verticl symptotes. Give
7.2 The Definite Integral
7.2 The Definite Integrl the definite integrl In the previous section, it ws found tht if function f is continuous nd nonnegtive, then the re under the grph of f on [, b] is given by F (b) F (), where
PAIR OF LINEAR EQUATIONS IN TWO VARIABLES
PAIR OF LINEAR EQUATIONS IN TWO VARIABLES. Two liner equtions in the sme two vriles re lled pir of liner equtions in two vriles. The most generl form of pir of liner equtions is x + y + 0 x + y + 0 where,,,,,,
MATH 573 FINAL EXAM. May 30, 2007
MATH 573 FINAL EXAM My 30, 007 NAME: Solutions 1. This exm is due Wednesdy, June 6 efore the 1:30 pm. After 1:30 pm I will NOT ccept the exm.. This exm hs 1 pges including this cover. There re 10 prolems.
List all of the possible rational roots of each equation. Then find all solutions (both real and imaginary) of the equation. 1.
Mth Anlysis CP WS 4.X- Section 4.-4.4 Review Complete ech question without the use of grphing clcultor.. Compre the mening of the words: roots, zeros nd fctors.. Determine whether - is root of 0. Show
Revision Sheet. (a) Give a regular expression for each of the following languages:
Theoreticl Computer Science (Bridging Course) Dr. G. D. Tipldi F. Bonirdi Winter Semester 2014/2015 Revision Sheet University of Freiurg Deprtment of Computer Science Question 1 (Finite Automt, 8 + 6 points)
ELE B7 Power System Engineering. Unbalanced Fault Analysis
Power System Engineering Unblnced Fult Anlysis Anlysis of Unblnced Systems Except for the blnced three-phse fult, fults result in n unblnced system. The most common types of fults re single lineground
Compiler Design. Fall Lexical Analysis. Sample Exercises and Solutions. Prof. Pedro C. Diniz
University of Southern Cliforni Computer Science Deprtment Compiler Design Fll Lexicl Anlysis Smple Exercises nd Solutions Prof. Pedro C. Diniz USC / Informtion Sciences Institute 4676 Admirlty Wy, Suite
More on automata. Michael George. March 24 April 7, 2014
More on utomt Michel George Mrch 24 April 7, 2014 1 Automt constructions Now tht we hve forml model of mchine, it is useful to mke some generl constructions. 1.1 DFA Union / Product construction Suppose
AP Calculus AB Summer Packet
AP Clculus AB Summer Pcket Nme: Welcome to AP Clculus AB! Congrtultions! You hve mde it to one of the most dvnced mth course in high school! It s quite n ccomplishment nd you should e proud of yourself
INF1383 -Bancos de Dados
3//0 INF383 -ncos de Ddos Prof. Sérgio Lifschitz DI PUC-Rio Eng. Computção, Sistems de Informção e Ciênci d Computção LGER RELCIONL lguns slides sedos ou modificdos dos originis em Elmsri nd Nvthe, Fundmentls
Intuitionistic Fuzzy Lattices and Intuitionistic Fuzzy Boolean Algebras
Intuitionistic Fuzzy Lttices nd Intuitionistic Fuzzy oolen Algebrs.K. Tripthy #1, M.K. Stpthy *2 nd P.K.Choudhury ##3 # School of Computing Science nd Engineering VIT University Vellore-632014, TN, Indi
State space systems analysis (continued) Stability. A. Definitions A system is said to be Asymptotically Stable (AS) when it satisfies
Stte spce systems nlysis (continued) Stbility A. Definitions A system is sid to be Asymptoticlly Stble (AS) when it stisfies ut () = 0, t > 0 lim xt () 0. t A system is AS if nd only if the impulse response
How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?
XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk out solving systems of liner equtions. These re prolems tht give couple of equtions with couple of unknowns, like: 6= x + x 7=
Fault Modeling. EE5375 ADD II Prof. MacDonald
Fult Modeling EE5375 ADD II Prof. McDonld Stuck At Fult Models l Modeling of physicl defects (fults) simplify to logicl fult l stuck high or low represents mny physicl defects esy to simulte technology
Integrals along Curves.
Integrls long Curves. 1. Pth integrls. Let : [, b] R n be continuous function nd let be the imge ([, b]) of. We refer to both nd s curve. If we need to distinguish between the two we cll the function the
Minimal DFA. minimal DFA for L starting from any other
Miniml DFA Among the mny DFAs ccepting the sme regulr lnguge L, there is exctly one (up to renming of sttes) which hs the smllest possile numer of sttes. Moreover, it is possile to otin tht miniml DFA
4.4 Areas, Integrals and Antiderivatives
. res, integrls nd ntiderivtives 333. Ares, Integrls nd Antiderivtives This section explores properties of functions defined s res nd exmines some connections mong res, integrls nd ntiderivtives. In order
Automata Theory 101. Introduction. Outline. Introduction Finite Automata Regular Expressions ω-automata. Ralf Huuck.
Outline Automt Theory 101 Rlf Huuck Introduction Finite Automt Regulr Expressions ω-automt Session 1 2006 Rlf Huuck 1 Session 1 2006 Rlf Huuck 2 Acknowledgement Some slides re sed on Wolfgng Thoms excellent