CS 311 Homework 3 due 16:30, Thursday, 14 th October 2010


 Eugene Dennis
 1 years ago
 Views:
Transcription
1 CS 311 Homework 3 due 16:30, Thursdy, 14 th Octoer 2010 Homework must e sumitted on pper, in clss. Question 1. [15 pts.; 5 pts. ech] Drw stte digrms for NFAs recognizing the following lnguges:. L = {w w {0, 1} nd w ends with 00}.. L is the lnguge represented y the regulr expression ( + ) ( + ). q0 q1 c. L = {0101, 101, 1100}. 1
2 Question 2. [30 pts.;, 5 pts.; c 20 pts.] L R is the lnguge of strings which re the reverse of the strings in the lnguge L. For L = {w w {, } nd in ech initil sustring of w, numer of s the numer of s 2} complete the following exercises:. Construct the digrm of DFA which ccepts strings in the lnguge L. 2
3 . Construct the digrm of n NFA which ccepts strings in the lnguge L R. q0 λ λ q5 λ q3 λ q4 c. Convert the NFA to DFA. Be sure to provide ll five components of the DFA, show the trnsition tle for δ, nd provide digrm. You my relel the sttes for 3
4 convenience, if you like. releling tkes plce. If you do, e sure to show the intermedite steps where Using the lzy construction method, we do εclosure on stte q5 to otin the initil stte q0q1q2q3q4q5 nd then uild the trnsition tle from there. Note the releling in the sme tle. δ q0q1q2q3q4q5 A q0q1q3q4 B q0q1q2q3 C q0q1q3q4 B q0q3q4 D q0q1q2q3 C q0q1q2q3 C q0q1q3q4 B q0q1q2 F q0q3q4 D q3q4 G q0q1q3 H q0q1q2 F q0q1q3 H q1q2 I q3q4 G q4 L q0q3 J q0q1q3 H q0q3q4 D q0q1q2 F q1q2 I q0q1 K q2 M q0q3 J q3q4 G q0q1 K q0q1 K q0q3 J q1q2 I q4 L Q q3 N q2 M q1 O Q q3 N q4 L q0 P q1 O q0 P q2 M q0 P q3 N q1 O Q Q Q We use ll sttes tht contin q0 s ccepting sttes giving Where δ is s defined in the tle, we hve F = {A, B, C, D, F, H, J, K, P }. M = {A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q}, {, }, δ, A, {A, B, C, D, F, H, J, K, P } Here is the digrm. Look how pretty it is! 4
5 H P Q C K F O I M Cn you find the oddity in this solution? I mde mistke in converting the NFA ut ws le to fix it y just simple deletion... Cn you see wht it is? Question 3. [25 pts.;,, c 5 pts; c 10 pts] Given lnguges L 1 = {w w {, }, w 3}, L 2 = {w w {, }, w contins },. Construct the digrms of the DFAs which ccept strings in the lnguges L 1 nd L 2. 5
6 . Construct the digrm of n NFA which ccepts strings in the lnguge L 1 L 2. 6
7 c. Convert the NFA to DFA, in the sme wy s in Question 2c. We define new initil stte sed on the εclosure of the initil stte q0 giving q0q1q5. Now we lzily construct the trnsition tle. δ q0q1q5 A q2q5 B q2q6 C q2q5 B q3q5 D q3q6 E q2q6 C q3q5 D q3q7 F q3q5 D q4q5 G q4q6 H q3q6 E q4q5 G q4q7 I q3q7 F q4q7 I q4q7 I q4q5 G q4q5 G q4q6 H q4q6 H q4q5 G q4q7 I q4q7 I q4q7 I q4q7 I The ccepting sttes re those sttes tht re ccepted y either one mchine or the other. Tht would e ll the sttes tht include q4 or q7. Thus we hve F = {F, G, H, I} nd we cn define the entire mchine with δ from the trnsition tle ove. M = {A, B, C, D, E, F, G, H, I}, {, }, δ, A, {F, G, H, I} And the pretty picture, with no minimiztion... 7
8 d. Define new set of ccepting sttes tht will mke the DFA ccept strings in the lnguge L 1 L 2. Explin riefly the difference etween this new set of ccepting sttes nd the set defined in prt c. of this question. The set of ccepting sttes for the union of two DFAs is simply the set of ll sttes in the union which contin one of the ccepting sttes from the originl mchines. Formlly this is denoted F = {F 1 Q 2 Q 1 F 2 } For the intersection of two DFAs we wnt the ccepting sttes to e those sttes which include ccepting sttes from oth mchines. Formlly this would e F = {F 1 F 2 } In the cse of this specific prolem the new set of ccepting sttes would e F = {I}. Question 4. [25 pts; 7 pts; 18 pts.]. Descrie the lnguge ccepted y the following NFA: 8
9 This NFA ccepts ll strings over {, } tht egin with nd end with. This cn e descried y the regulr expression ( + ).. Prove tht this NFA ccepts the lnguge tht you descried in prt (). In your proof, use induction on the length of the input. Be sure to stte your induction hypothesis explicitly. Hint: You will use wht Hopcroft et l. cll mutul induction ( 1.4.4) (end of hint). We will complete this proof using mutul induction, where set of conditions is creted to descrie the ction of the mchine. This set of conditions will demonstrte tht the mchine ehves s descried ove. First, the three conditions. () q0 ˆδ(q0, w) w = ε. () q1 ˆδ(q0, w) w egins with (c) q2 ˆδ(q0, w) w egins with nd ends with Our tsk is to verify tht these conditions hold for ll input nd tht the pproprite input leds to cceptnce. Bse Cse For w = 0, we know the only string with mgnitude 0 is ε, so w = ε. () Becuse q0 is the initil stte of the mchine, nd there re no εtrnsitions from q0, then q0 ˆδ(q0, w) so the left hnd side holds. Since w = ε, the right hnd side holds s well nd the iconditionl is true. 9
10 () Since there re no εtrnsitions from the initil stte to q1, it follows tht q1 ˆδ(q0, w) nd the left hnd side is flse. It is cler tht w does not strt with nd so the right hnd side is flse s well. Therefore the iconditionl is true. (c) By the sme resoning s (), it follows tht condition (c) is lso true. Inductive Hypothesis Assume tht for w = n, ll three conditions hold. Inductive Step We now prove tht the three conditions hold for w = n + 1. Let w = xz where x = n nd z Σ. Thus w = x + 1 = n + 1. () There re no trnsitions into q0, so for ny w such tht w 1, q0 / ˆδ(q0, w) nd the left hnd side is flse. Since clerly w ε, the right hnd side is lso flse nd the iconditionl is true. () Consider the prefix string x. By the inductive hypothesis, ll the conditions hold for x, which mens tht condition () holds for x. This mens there re two cses to consider. The first, x strts with, mens tht q1 ˆδ(q0, x). Since there is trnsition from q1 to q1 on oth or, it does not mtter wht symol z is, it follows tht q1 ˆδ(q0, w). In this cse, no mtter wht z is, x will still strt with nd thus w will strt with. Thus the iconditionl will lwys e true. The second cse, x strts with, mens tht q1 / ˆδ(q0, x). Further, ecuse there is no trnsition out of q0 on, the mchine is stuck. Thus is does not mtter wht symol z is, it will lwys e the cse tht q1 / ˆδ(q0, w). Since x strts with it follows tht no mtter wht z is, w will lso strt with. Thus oth sides of the iconditionl will lwys e flse nd the iconditionl itself will lwys e true. (c) The only trnsition into q2 is on from q1. So ny cse which does not ensure q1 ˆδ(q0, x) implies tht q2 / ˆδ(q0, w) nd from condition () we know tht if x does not strt with then q1 / ˆδ(q0, x) nd it follows tht q2 / ˆδ(q0, w). Thus in this sitution, the iconditionl will lwys e true. Now consider the sitution where q1 ˆδ(q0, x). By the inductive hypothesis nd (), we know this implies tht x strts with. Here we hve two cses: z = nd z =. In the first cse, z =, it follows tht w ends with, nd not. Since there is no trnsition from q1 to q2 on n, then we cn conclude tht q2 / ˆδ(q0, w). Likewise, if q2 / ˆδ(q0, w) then we cn surmise tht the trnsition from q1 to q2 on ws not tken nd therefore, w does not end in. Thus the iconditionl is true in oth directions. In the second cse, z =, it follows tht w ends in. Since we know q1 ˆδ(q0, x) nd there is trnsition from q1 to q2 on, it follows tht q2 ˆδ(q0, w). Likewise, if q2 ˆδ(q0, w), since the only trnsition into q2 is from q1 on, then it follows tht w ends with. Agin the iconditionl is true in oth directions. Since in condition (c), it is required to pss through q1 to get to q2, nd q2 is the only ccepting stte of the mchine, it follows tht q1 ˆδ(q0, x) is necessry for cceptnce, 10
11 nd thus w must strt with. Agin, y condition (c), for q2 ˆδ(q0, w) to e true, then w must end with. Thus we show tht cceptnce y this mchine only occurs for strings tht strt with nd end with. I don t hold tht this proof is completely ulletproof. If there re ny holes, plese feel free to point them out, nd I ll mke corrections. It is tricky there re lot of cses to consider ll the wy through. But hopefully, this proof illustrtes the process resonly well. 11
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
More informationHomework 3 Solutions
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}.
More informationHomework 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)
More informationHomework Solution  Set 5 Due: Friday 10/03/08
CE 96 Introduction to the Theory of Computtion ll 2008 Homework olution  et 5 Due: ridy 10/0/08 1. Textook, Pge 86, Exercise 1.21. () 1 2 Add new strt stte nd finl stte. Mke originl finl stte nonfinl.
More informationa,b a 1 a 2 a 3 a,b 1 a,b a,b 2 3 a,b a,b a 2 a,b CS Determinisitic Finite Automata 1
CS4 45 Determinisitic Finite Automt : Genertors vs. Checkers Regulr expressions re one wy to specify forml lnguge String Genertor Genertes strings in the lnguge Deterministic Finite Automt (DFA) re nother
More informationState Minimization for DFAs
Stte Minimiztion for DFAs Red K & S 2.7 Do Homework 10. Consider: Stte Minimiztion 4 5 Is this miniml mchine? Step (1): Get rid of unrechle sttes. Stte Minimiztion 6, Stte is unrechle. Step (2): Get rid
More information1 From NFA to regular expression
Note 1: How to convert DFA/NFA to regulr expression Version: 1.0 S/EE 374, Fll 2017 Septemer 11, 2017 In this note, we show tht ny DFA cn e converted into regulr expression. Our construction would work
More informationRegular Expressions (RE) Regular Expressions (RE) Regular Expressions (RE) Regular Expressions (RE) Kleene*
Regulr Expressions (RE) Regulr Expressions (RE) Empty set F A RE denotes the empty set Opertion Nottion Lnguge UNIX Empty string A RE denotes the set {} Alterntion R +r L(r ) L(r ) r r Symol Alterntion
More information1 Nondeterministic Finite Automata
1 Nondeterministic Finite Automt Suppose in life, whenever you hd choice, you could try oth possiilities nd live your life. At the end, you would go ck nd choose the one tht worked out the est. Then you
More informationinput tape head moves current state
CPS 140  Mthemticl Foundtions of CS Dr. Susn Rodger Section: Finite Automt (Ch. 2) (lecture notes) Things to do in clss tody (Jn. 13, 2004): ffl questions on homework 1 ffl finish chpter 1 ffl Red Chpter
More informationNondeterministic Finite Automata
Nondeterministic Finite Automt From Regulr Expressions to NFA Eliminting nondeterminism Rdoud University Nijmegen Nondeterministic Finite Automt H. Geuvers nd J. Rot Institute for Computing nd Informtion
More informationCS 330 Formal Methods and Models
CS 330 Forml Methods nd Models Dn Richrds, section 003, George Mson University, Fll 2017 Quiz Solutions Quiz 1, Propositionl Logic Dte: Septemer 7 1. Prove (p q) (p q), () (5pts) using truth tles. p q
More information3 Regular expressions
3 Regulr expressions Given n lphet Σ lnguge is set of words L Σ. So fr we were le to descrie lnguges either y using set theory (i.e. enumertion or comprehension) or y n utomton. In this section we shll
More information12.1 Nondeterminism Nondeterministic Finite Automata. a a b ε. CS125 Lecture 12 Fall 2016
CS125 Lecture 12 Fll 2016 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
More informationTypes of Finite Automata. CMSC 330: Organization of Programming Languages. Comparing DFAs and NFAs. NFA for (a b)*abb.
CMSC 330: Orgniztion of Progrmming Lnguges Finite Automt 2 Types of Finite Automt Deterministic Finite Automt () Exctly one sequence of steps for ech string All exmples so fr Nondeterministic Finite Automt
More informationGrammar. Languages. Content 5/10/16. Automata and Languages. Regular Languages. Regular Languages
5//6 Grmmr Automt nd Lnguges Regulr Grmmr Contextfree Grmmr Contextsensitive Grmmr Prof. Mohmed Hmd Softwre Engineering L. The University of Aizu Jpn Regulr Lnguges Context Free Lnguges Context Sensitive
More informationNondeterminism. Nondeterministic Finite Automata. Example: Moves on a Chessboard. Nondeterminism (2) Example: Chessboard (2) Formal NFA
Nondeterminism Nondeterministic Finite Automt Nondeterminism Subset Construction A nondeterministic finite utomton hs the bility to be in severl sttes t once. Trnsitions from stte on n input symbol cn
More informationOverview HC9. Parsing: TopDown & LL(1) ContextFree Grammars (1) Introduction. CFGs (3) ContextFree Grammars (2) Vertalerbouw HC 9: Ch.
Overview H9 Vertlerouw H 9: Prsing: opdown & LL(1) do 3 mei 2001 56 heo Ruys h. 8  Prsing 8.1 ontextfree Grmmrs 8.2 opdown Prsing 8.3 LL(1) Grmmrs See lso [ho, Sethi & Ullmn 1986] for more thorough
More informationChapter 2 Finite Automata
Chpter 2 Finite Automt 28 2.1 Introduction Finite utomt: first model of the notion of effective procedure. (They lso hve mny other pplictions). The concept of finite utomton cn e derived y exmining wht
More informationImproper Integrals. The First Fundamental Theorem of Calculus, as we ve discussed in class, goes as follows:
Improper Integrls The First Fundmentl Theorem of Clculus, s we ve discussed in clss, goes s follows: If f is continuous on the intervl [, ] nd F is function for which F t = ft, then ftdt = F F. An integrl
More informationChapter 4 Regular Grammar and Regular Sets. (Solutions / Hints)
C K Ngpl Forml Lnguges nd utomt Theory Chpter 4 Regulr Grmmr nd Regulr ets (olutions / Hints) ol. (),,,,,,,,,,,,,,,,,,,,,,,,,, (),, (c) c c, c c, c, c, c c, c, c, c, c, c, c, c c,c, c, c, c, c, c, c, c,
More informationNONDETERMINISTIC FSA
Tw o types of nondeterminism: NONDETERMINISTIC FS () Multiple strtsttes; strtsttes S Q. The lnguge L(M) ={x:x tkes M from some strtstte to some finlstte nd ll of x is proessed}. The string x = is
More informationLecture 9: LTL and Büchi Automata
Lecture 9: LTL nd Büchi Automt 1 LTL Property Ptterns Quite often the requirements of system follow some simple ptterns. Sometimes we wnt to specify tht property should only hold in certin context, clled
More informationAutomata 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
More informationChapter 1, Part 1. Regular Languages. CSC527, Chapter 1, Part 1 c 2012 Mitsunori Ogihara 1
Chpter 1, Prt 1 Regulr Lnguges CSC527, Chpter 1, Prt 1 c 2012 Mitsunori Ogihr 1 Finite Automt A finite utomton is system for processing ny finite sequence of symols, where the symols re chosen from finite
More information10. AREAS BETWEEN CURVES
. AREAS BETWEEN CURVES.. Ares etween curves So res ove the xxis re positive nd res elow re negtive, right? Wrong! We lied! Well, when you first lern out integrtion it s convenient fiction tht s true in
More informationCS12N: 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
More informationFarey 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
More informationPrefixFree Subsets of Regular Languages and Descriptional Complexity
PrefixFree Susets of Regulr Lnguges nd Descriptionl Complexity Jozef Jirásek Jurj Šeej DCFS 2015 PrefixFree Susets of Regulr Lnguges nd Descriptionl Complexity Jozef Jirásek, Jurj Šeej 1/22 Outline Mximl
More informationLinear Systems with Constant Coefficients
Liner Systems with Constnt Coefficients 4305 Here is system of n differentil equtions in n unknowns: x x + + n x n, x x + + n x n, x n n x + + nn x n This is constnt coefficient liner homogeneous system
More informationAutomata and Languages
Automt nd Lnguges Prof. Mohmed Hmd Softwre Engineering Lb. The University of Aizu Jpn Grmmr Regulr Grmmr Contextfree Grmmr Contextsensitive Grmmr Regulr Lnguges Context Free Lnguges Context Sensitive
More informationFormal Languages and Automata Theory. D. Goswami and K. V. Krishna
Forml Lnguges nd Automt Theory D. Goswmi nd K. V. Krishn Novemer 5, 2010 Contents 1 Mthemticl Preliminries 3 2 Forml Lnguges 4 2.1 Strings............................... 5 2.2 Lnguges.............................
More informationPrefixFree RegularExpression Matching
PrefixFree RegulrExpression Mthing YoSu Hn, Yjun Wng nd Derik Wood Deprtment of Computer Siene HKUST PrefixFree RegulrExpression Mthing p.1/15 Pttern Mthing Given pttern P nd text T, find ll sustrings
More informationRecursively Enumerable and Recursive. Languages
Recursively Enumerble nd Recursive nguges 1 Recll Definition (clss 19.pdf) Definition 10.4, inz, 6 th, pge 279 et S be set of strings. An enumertion procedure for Turing Mchine tht genertes ll strings
More informationMATH 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.
More informationSection: Other Models of Turing Machines. Definition: Two automata are equivalent if they accept the same language.
Section: Other Models of Turing Mchines Definition: Two utomt re equivlent if they ccept the sme lnguge. Turing Mchines with Sty Option Modify δ, Theorem Clss of stndrd TM s is equivlent to clss of TM
More informationContinuous Random Variables Class 5, Jeremy Orloff and Jonathan Bloom
Lerning Gols Continuous Rndom Vriles Clss 5, 8.05 Jeremy Orloff nd Jonthn Bloom. Know the definition of continuous rndom vrile. 2. Know the definition of the proility density function (pdf) nd cumultive
More informationThe University of Nottingham
The University of Nottinghm SCHOOL OF COMPUTR SCINC AND INFORMATION TCHNOLOGY A LVL 1 MODUL, SPRING SMSTR 20042005 MACHINS AND THIR LANGUAGS Time llowed TWO hours Cndidtes must NOT strt writing their
More informationCSCI FOUNDATIONS OF COMPUTER SCIENCE
1 CSCI 2200 FOUNDATIONS OF COMPUTER SCIENCE Spring 2015 My 7, 2015 2 Announcements Homework 9 is due now. Some finl exm review problems will be posted on the web site tody. These re prcqce problems not
More information16 Newton s Laws #3: Components, Friction, Ramps, Pulleys, and Strings
Chpter 16 Newton s Lws #3: Components, riction, Rmps, Pulleys, nd Strings 16 Newton s Lws #3: Components, riction, Rmps, Pulleys, nd Strings When, in the cse of tilted coordinte system, you brek up the
More informationLecture 7 notes Nodal Analysis
Lecture 7 notes Nodl Anlysis Generl Network Anlysis In mny cses you hve multiple unknowns in circuit, sy the voltges cross multiple resistors. Network nlysis is systemtic wy to generte multiple equtions
More informationMTH 505: Number Theory Spring 2017
MTH 505: Numer Theory Spring 207 Homework 2 Drew Armstrong The Froenius Coin Prolem. Consider the eqution x ` y c where,, c, x, y re nturl numers. We cn think of $ nd $ s two denomintions of coins nd $c
More information2 b. , a. area is S= 2π xds. Again, understand where these formulas came from (pages ).
AP Clculus BC Review Chpter 8 Prt nd Chpter 9 Things to Know nd Be Ale to Do Know everything from the first prt of Chpter 8 Given n integrnd figure out how to ntidifferentite it using ny of the following
More informationChapter 4 Contravariance, Covariance, and Spacetime Diagrams
Chpter 4 Contrvrince, Covrince, nd Spcetime Digrms 4. The Components of Vector in Skewed Coordintes We hve seen in Chpter 3; figure 3.9, tht in order to show inertil motion tht is consistent with the Lorentz
More informationQuadratic reciprocity
Qudrtic recirocity Frncisc Bozgn Los Angeles Mth Circle Octoer 8, 01 1 Qudrtic Recirocity nd Legendre Symol In the eginning of this lecture, we recll some sic knowledge out modulr rithmetic: Definition
More informationImproper Integrals. Introduction. Type 1: Improper Integrals on Infinite Intervals. When we defined the definite integral.
Improper Integrls Introduction When we defined the definite integrl f d we ssumed tht f ws continuous on [, ] where [, ] ws finite, closed intervl There re t lest two wys this definition cn fil to e stisfied:
More information4 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
More informationHomework Assignment 3 Solution Set
Homework Assignment 3 Solution Set PHYCS 44 6 Ferury, 4 Prolem 1 (Griffiths.5(c The potentil due to ny continuous chrge distriution is the sum of the contriutions from ech infinitesiml chrge in the distriution.
More informationArithmetic & Algebra. NCTM National Conference, 2017
NCTM Ntionl Conference, 2017 Arithmetic & Algebr Hether Dlls, UCLA Mthemtics & The Curtis Center Roger Howe, Yle Mthemtics & Texs A & M School of Eduction Relted Common Core Stndrds First instnce of vrible
More informationThe Wave Equation I. MA 436 Kurt Bryan
1 Introduction The Wve Eqution I MA 436 Kurt Bryn Consider string stretching long the x xis, of indeterminte (or even infinite!) length. We wnt to derive n eqution which models the motion of the string
More informationThe final exam will take place on Friday May 11th from 8am 11am in Evans room 60.
Mth 104: finl informtion The finl exm will tke plce on Fridy My 11th from 8m 11m in Evns room 60. The exm will cover ll prts of the course with equl weighting. It will cover Chpters 1 5, 7 15, 17 21, 23
More informationOn Determinisation of HistoryDeterministic Automata.
On Deterministion of HistoryDeterministic Automt. Denis Kupererg Mich l Skrzypczk University of Wrsw YRICALP 2014 Copenhgen Introduction Deterministic utomt re centrl tool in utomt theory: Polynomil
More information1 Online Learning and Regret Minimization
2.997 DecisionMking in LrgeScle Systems My 10 MIT, Spring 2004 Hndout #29 Lecture Note 24 1 Online Lerning nd Regret Minimiztion In this lecture, we consider the problem of sequentil decision mking in
More informationexpression 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
More informationNondeterministic Biautomata and Their Descriptional Complexity
Nondeterministic Biutomt nd Their Descriptionl Complexity Mrkus Holzer nd Sestin Jkoi Institut für Informtik JustusLieigUniversität Arndtstr. 2, 35392 Gießen, Germny 23. Theorietg Automten und Formle
More informationSection 6.1 Definite Integral
Section 6.1 Definite Integrl Suppose we wnt to find the re of region tht is not so nicely shped. For exmple, consider the function shown elow. The re elow the curve nd ove the x xis cnnot e determined
More informationSection 7.1 Area of a Region Between Two Curves
Section 7.1 Are of Region Between Two Curves White Bord Chllenge The circle elow is inscried into squre: Clcultor 0 cm Wht is the shded re? 400 100 85.841cm White Bord Chllenge Find the re of the region
More informationPHYSICS 211 MIDTERM I 21 April 2004
PHYSICS MIDERM I April 004 Exm is closed book, closed notes. Use only your formul sheet. Write ll work nd nswers in exm booklets. he bcks of pges will not be grded unless you so request on the front of
More informationSpeech Recognition Lecture 2: Finite Automata and FiniteState Transducers
Speech Recognition Lecture 2: Finite Automt nd FiniteStte Trnsducers Eugene Weinstein Google, NYU Cournt Institute eugenew@cs.nyu.edu Slide Credit: Mehryr Mohri Preliminries Finite lphet, empty string.
More informationThe Minimization Problem. The Minimization Problem. The Minimization Problem. The Minimization Problem. The Minimization Problem
Simpler & More Generl Minimiztion for Weighted FiniteStte Automt Json Eisner Johns Hopkins University My 28, 2003 HLTNAACL First hlf of tlk is setup  revies pst ork. Second hlf gives outline of the
More informationThis chapter will show you. What you should already know. 1 Write down the value of each of the following. a 5 2
1 Direct vrition 2 Inverse vrition This chpter will show you how to solve prolems where two vriles re connected y reltionship tht vries in direct or inverse proportion Direct proportion Inverse proportion
More information#A29 INTEGERS 17 (2017) EQUALITY OF DEDEKIND SUMS MODULO 24Z
#A29 INTEGERS 17 (2017) EQUALITY OF DEDEKIND SUMS MODULO 24Z Kurt Girstmir Institut für Mthemtik, Universität Innsruck, Innsruck, Austri kurt.girstmir@uik.c.t Received: 10/4/16, Accepted: 7/3/17, Pulished:
More information5.1 Estimating with Finite Sums Calculus
5.1 ESTIMATING WITH FINITE SUMS Emple: Suppose from the nd to 4 th hour of our rod trip, ou trvel with the cruise control set to ectl 70 miles per hour for tht two hour stretch. How fr hve ou trveled during
More informationWorksheet A EXPONENTIALS AND LOGARITHMS PMT. 1 Express each of the following in the form log a b = c. a 10 3 = 1000 b 3 4 = 81 c 256 = 2 8 d 7 0 = 1
C Worksheet A Epress ech of the following in the form log = c. 0 = 000 4 = 8 c 56 = 8 d 7 0 = e = f 5 = g 7 9 = 9 h 6 = 6 Epress ech of the following using inde nottion. log 5 5 = log 6 = 4 c 5 = log 0
More informationTriangles The following examples explore aspects of triangles:
Tringles The following exmples explore spects of tringles: xmple 1: ltitude of right ngled tringle + xmple : tringle ltitude of the symmetricl ltitude of n isosceles x x  4 +x xmple 3: ltitude of the
More informationBest Approximation. Chapter The General Case
Chpter 4 Best Approximtion 4.1 The Generl Cse In the previous chpter, we hve seen how n interpolting polynomil cn be used s n pproximtion to given function. We now wnt to find the best pproximtion to given
More informationNondeterministic Finite Automata
Nondeterministi Finite utomt The Power of Guessing Tuesdy, Otoer 4, 2 Reding: Sipser.2 (first prt); Stoughton 3.3 3.5 S235 Lnguges nd utomt eprtment of omputer Siene Wellesley ollege Finite utomton (F)
More informationTopic 1 Notes Jeremy Orloff
Topic 1 Notes Jerem Orloff 1 Introduction to differentil equtions 1.1 Gols 1. Know the definition of differentil eqution. 2. Know our first nd second most importnt equtions nd their solutions. 3. Be ble
More informationChapter Five  Eigenvalues, Eigenfunctions, and All That
Chpter Five  Eigenvlues, Eigenfunctions, n All Tht The prtil ifferentil eqution methos escrie in the previous chpter is specil cse of more generl setting in which we hve n eqution of the form L 1 xux,tl
More informationHow to simulate Turing machines by invertible onedimensional cellular automata
How to simulte Turing mchines by invertible onedimensionl cellulr utomt JenChristophe Dubcq Déprtement de Mthémtiques et d Informtique, École Normle Supérieure de Lyon, 46, llée d Itlie, 69364 Lyon Cedex
More informationGRADE 4. Division WORKSHEETS
GRADE Division WORKSHEETS Division division is shring nd grouping Division cn men shring or grouping. There re cndies shred mong kids. How mny re in ech shre? = 3 There re 6 pples nd go into ech bsket.
More informationBernd Finkbeiner Date: October 25, Automata, Games, and Verification: Lecture 2
Bernd Finkeiner Dte: Octoer 25, 2012 Automt, Gmes, nd Verifiction: Lecture 2 2 Büchi Automt Definition1 AnondeterministicBüchiutomtonAoverlphetΣistuple(S,I,T,F): S : finitesetof sttes I S:susetof initilsttes
More informationWhat else can you do?
Wht else cn you do? ngle sums The size of specil ngle types lernt erlier cn e used to find unknown ngles. tht form stright line dd to 180c. lculte the size of + M, if L is stright line M + L = 180c( stright
More informationProblem Set 9. Figure 1: Diagram. This picture is a rough sketch of the 4 parabolas that give us the area that we need to find. The equations are:
(x + y ) = y + (x + y ) = x + Problem Set 9 Discussion: Nov., Nov. 8, Nov. (on probbility nd binomil coefficients) The nme fter the problem is the designted writer of the solution of tht problem. (No one
More informationMATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35
MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35 9. Modules over PID This week we re proving the fundmentl theorem for finitely generted modules over PID, nmely tht they re ll direct sums of cyclic modules.
More informationComplementing Büchi Automata with a Subsettuple Construction
DEPARTEMENT D INFORMATIQUE DEPARTEMENT FÜR INFORMATIK Bd de Pérolles 90 CH1700 Friourg www.unifr.ch/informtics WORKING PAPER Complementing Büchi Automt with Susettuple Construction J. Allred & U. UltesNitsche
More informationQUADRATIC EQUATIONS OBJECTIVE PROBLEMS
QUADRATIC EQUATIONS OBJECTIVE PROBLEMS +. The solution of the eqution will e (), () 0,, 5, 5. The roots of the given eqution ( p q) ( q r) ( r p) 0 + + re p q r p (), r p p q, q r p q (), (d), q r p q.
More informationDiophantine Steiner Triples and PythagoreanType Triangles
Forum Geometricorum Volume 10 (2010) 93 97. FORUM GEOM ISSN 15341178 Diophntine Steiner Triples nd PythgorenType Tringles ojn Hvl bstrct. We present connection between Diophntine Steiner triples (integer
More informationUSA Mathematical Talent Search Round 1 Solutions Year 21 Academic Year
1/1/21. Fill in the circles in the picture t right with the digits 18, one digit in ech circle with no digit repeted, so tht no two circles tht re connected by line segment contin consecutive digits.
More information5.1 Definitions and Examples 5.2 Deterministic Pushdown Automata
CSC4510 AUTOMATA 5.1 Definitions nd Exmples 5.2 Deterministic Pushdown Automt Definitions nd Exmples A lnguge cn be generted by CFG if nd only if it cn be ccepted by pushdown utomton. A pushdown utomton
More informationPlane Surveying Levelling
Deprtment of Civil Engineering, UC Introduction: Levelling is mens y which surveyors cn determine the elevtion of points, using other known points s references. Levelling is perhps the most sic of surveying
More informationAnalytically, vectors will be represented by lowercase boldface 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
More informationWe know that if f is a continuous nonnegative function on the interval [a, b], then b
1 Ares Between Curves c 22 Donld Kreider nd Dwight Lhr We know tht if f is continuous nonnegtive function on the intervl [, b], then f(x) dx is the re under the grph of f nd bove the intervl. We re going
More informationGeneral idea LR(0) SLR LR(1) LALR To best exploit JavaCUP, should understand the theoretical basis (LR parsing);
Bottom up prsing Generl ide LR(0) SLR LR(1) LLR To best exploit JvCUP, should understnd the theoreticl bsis (LR prsing); 1 Topdown vs Bottomup Bottomup more powerful thn topdown; Cn process more powerful
More informationdx dt dy = G(t, x, y), dt where the functions are defined on I Ω, and are locally Lipschitz w.r.t. variable (x, y) Ω.
Chpter 8 Stility theory We discuss properties of solutions of first order two dimensionl system, nd stility theory for specil clss of liner systems. We denote the independent vrile y t in plce of x, nd
More informationLecture V. Introduction to Space Groups Charles H. Lake
Lecture V. Introduction to Spce Groups 2003. Chrles H. Lke Outline:. Introduction B. Trnsltionl symmetry C. Nomenclture nd symols used with spce groups D. The spce groups E. Derivtion nd discussion of
More informationEMF Notes 9; Electromagnetic Induction ELECTROMAGNETIC INDUCTION
EMF Notes 9; Electromgnetic nduction EECTOMAGNETC NDUCTON (Y&F Chpters 3, 3; Ohnin Chpter 3) These notes cover: Motionl emf nd the electric genertor Electromgnetic nduction nd Frdy s w enz s w nduced electric
More informationx ) dx dx x sec x over the interval (, ).
Curve on 6 For , () Evlute the integrl, n (b) check your nswer by ifferentiting. ( ). ( ). ( ).. 6. sin cos 7. sec csccot 8. sec (sec tn ) 9. sin csc. Evlute the integrl sin by multiplying the numertor
More information2. VECTORS AND MATRICES IN 3 DIMENSIONS
2 VECTORS AND MATRICES IN 3 DIMENSIONS 21 Extending the Theory of 2dimensionl Vectors x A point in 3dimensionl spce cn e represented y column vector of the form y z zxis yxis z x y xxis Most of the
More informationPolynomial Approximations for the Natural Logarithm and Arctangent Functions. Math 230
Polynomil Approimtions for the Nturl Logrithm nd Arctngent Functions Mth 23 You recll from first semester clculus how one cn use the derivtive to find n eqution for the tngent line to function t given
More informationMath 8 Winter 2015 Applications of Integration
Mth 8 Winter 205 Applictions of Integrtion Here re few importnt pplictions of integrtion. The pplictions you my see on n exm in this course include only the Net Chnge Theorem (which is relly just the Fundmentl
More informationResources. Introduction: Binding. Resource Types. Resource Sharing. The type of a resource denotes its ability to perform different operations
Introduction: Binding Prt of 4lecture introduction Scheduling Resource inding Are nd performnce estimtion Control unit synthesis This lecture covers Resources nd resource types Resource shring nd inding
More informationState Complexity of Union and Intersection of Binary SuffixFree Languages
Stte Complexity of Union nd Intersetion of Binry SuffixFree Lnguges Glin Jirásková nd Pvol Olejár Slovk Ademy of Sienes nd Šfárik University, Košie 0000 1111 0000 1111 Glin Jirásková nd Pvol Olejár Binry
More informationNormal Forms for Contextfree Grammars
Norml Forms for Contextfree Grmmrs 1 Linz 6th, Section 6.2 wo Importnt Norml Forms, pges 171178 2 Chomsky Norml Form All productions hve form: A BC nd A vrile vrile terminl 3 Exmples: S AS S AS S S
More information8 Automata and formal languages. 8.1 Formal languages
8 Automt nd forml lnguges This exposition ws developed y Clemens Gröpl nd Knut Reinert. It is sed on the following references, ll of which re recommended reding: 1. Uwe Schöning: Theoretische Informtik
More information20 MATHEMATICS POLYNOMIALS
0 MATHEMATICS POLYNOMIALS.1 Introduction In Clss IX, you hve studied polynomils in one vrible nd their degrees. Recll tht if p(x) is polynomil in x, the highest power of x in p(x) is clled the degree of
More informationDomino Recognizability of Triangular Picture Languages
Interntionl Journl of Computer Applictions (0975 8887) Volume 57 No.5 Novemer 0 Domino Recognizility of ringulr icture Lnguges V. Devi Rjselvi Reserch Scholr Sthym University Chenni 600 9. Klyni Hed of
More information3.1 Review of Sine, Cosine and Tangent for Right Angles
Foundtions of Mth 11 Section 3.1 Review of Sine, osine nd Tngent for Right Tringles 125 3.1 Review of Sine, osine nd Tngent for Right ngles The word trigonometry is derived from the Greek words trigon,
More information8 factors of x. For our second example, let s raise a power to a power:
CH 5 THE FIVE LAWS OF EXPONENTS EXPONENTS WITH VARIABLES It s no time for chnge in tctics, in order to give us deeper understnding of eponents. For ech of the folloing five emples, e ill stretch nd squish,
More informationLINEAR ALGEBRA APPLIED
5.5 Applictions of Inner Product Spces 5.5 Applictions of Inner Product Spces 7 Find the cross product of two vectors in R. Find the liner or qudrtic lest squres pproimtion of function. Find the nthorder
More information