Formal Languages: Review
|
|
- Magnus Blake
- 5 years ago
- Views:
Transcription
1 Formal Languags: Rviw Alphabt: a finit st of symbols String: a finit squnc of symbols Languag: a st of strings String lngth: numbr of symbols in it String concatnation: w 1 w 2 Empty string: or ^ Languag concatnation: L 1 L 2 ={w 1 w 2 w 1 L 1, w 2 L 2 } String xponntiation: w k = ww w (k tims) Languag xponntiation: L k = LL L (k tims) LL = L 2 L k =LL k-1 L 0 ={} S={a,b} ababbaab L={a,aa,aaa, } aba =3 ab ba=abba "w w = w = w {1,2} {a,aa, } ={1a,2a,1aa,2aa, } a 3 =aaa {0,1} 32
2 Formal Languags: Rviw String rvrsal: w R Trivial languag: {} Empty languag: Ø All finit strings: S * L S * "L Thorm: S * is countabl, S * = Z Thorm: 2 S* is uncountabl. Thorm: S * contains no infinit strings. (aabc) R =cbaa Languag rvrsal: L R ={w R w L} {ab,cd} R ={ba,dc} Kln closur: L * = L 0 L 1 L 2 L 3... {a} * L + = L 1 L 2 L 3 L 4... {a} + Thorm: L + = LL * {} L=L {}=L Ø * ={} {a,aa,aaa, } dovtailing diagonalization finit strings in S i Thorm: (L * ) * =L * L * (L * ) * & (L * ) * L *
3 Finit Automata: Rviw Basic ida: a FA is a machin that changs stats whil procssing symbols, on at a tim. Finit st of stats: Q = {q 0, q 1, q 3,..., q k } Transition function: Initial stat: Final stats: d: Q S Q q 0 Q F Q Finit automaton is M=(Q, S, d, q 0, F) q 1 q i q 0 q k q j Ex: an FA that accpts all odd-lngth strings of zros: 0 q 0 q 1 0 M=({q 0,q 1 }, {0}, {((q 0,0),q 1 ), ((q 1,0),q 0 )}, q 0, {q 1 })
4 Finit Automata: Rviw FA opration: consum a string w S * on symbol at a tim whil changing stats Accptanc: nd up in a final stat Rjction: anything ls (including hang-up / crash) Ex: FA that accpts all strings of form abababab = (ab) * M a M=({q 0,q 1 }, {a,b}, {((q 0,a),q 1 ), ((q 1,b),q 0 )}, q 0, {q 0 }) b q 0 b q 2 q 1 a But M crashs on input string abba! Solution: add dad-nd stat to fully spcify M M a,b M =({q 0,q 1,q 2 }, {a,b}, {((q 0,a),q 1 ), ((q 1,b),q 0 ), ((q 0,b),q 2 ), ((q 1,b),q 2 ). ((q 2,a),q 2 ), ((q 2,b),q 2 ) }, q 0, {q 0 })
5 Finit Automata: Rviw Transition function d xtnds from symbols to strings: d:q S* Q d(q 0,wx) = d(d(q 0,w),x) whr d(q i,) = q i Languag of M is L(M)={w S* d(q 0,w) F} Dfinition: languag is rgular iff it is accptd by som FA. Thorm: Complmntation prsrvs rgularity. Proof: Invrt final and non-final stats in fully spcifid FA. b q 0 a b q 1 M q 1 q 2 a,b a b q 0 a M b q 2 a,b a L(M)=(ab) * L(M )= b(a+b) * + (a+b) * a + (a+b) * (aa+bb)(a+b) * M simulats M and dos th opposit!
6 Problm: dsign a DFA that accpts all strings ovr {a,b} whr any a s prcd any b s. Ida: skip ovr any contiguous a s, thn skip ovr any b s, and thn accpt iff th nd is rachd. a b a,b q 0 b q 1 a q 2 L = a*b* Q: What is th complmnt of L?
7 Problm: what is th complmnt of L = a*b*? Ida: writ a rgular xprssion and thn simplify. L = (a+b)*b + (a+b)*a + (a+b)* = (a+b)*b(a+b)*a(a+b)* = (a+b)*b + a(a+b)* = (a+b)*ba(a+b)* = a*b + a(a+b)* a b a,b q 0 b q 1 a q 2
8 Finit Automata: Rviw Thorm: Intrsction prsrvs rgularity. Proof: ( paralll simulation): Construct all supr-stats, on pr ach stat pair. Nw supr-transition function jumps among supr-stats, simulating old transition function Initial supr stat contains both old initial stats. Final supr stats contains pairs of old final stats. Rsulting DFA accpts sam languag as original NFA (but siz can b th product of two old sizs). Givn M 1 =(Q 1, S, d 1, q, F 1 ) and M 2 =(Q 2, S, d 2, q, F 2 ) construct M=(Q, S, d, q, F) Q = Q 1 Q 2 F = F 1 F 2 q=(q,q ) d :Q S Q d((q i,q j ),x) = (d 1 (q i,x),d 2 (q j,x))
9 Finit Automata: Rviw Thorm: Union prsrvs rgularity. Proof: D Morgan's law: L 1 L 2 = L 1 L 2 Or cross-product construction, i.., paralll simulation with F = (F 1 Q 2 ) (Q 1 F 2 ) Thorm: St diffrnc prsrvs rgularity. Proof: St idntity L 1 L 2 = L 1 L 2 Or cross-product construction, i.., paralll simulation with F = (F 1 (Q 2 F 2 )) Thorm: XOR prsrvs rgularity. Proof: St idntity L 1 L 2 = (L 1 L 2 ) (L 1 L 2 ) Or cross-product construction, i.., paralll simulation with F = (F 1 (Q 2 F 2 )) ((Q 1 F 1 ) F 2 ) Mta-Thorm: Idntity-basd proofs ar asir!
10 Finit Automata: Rviw Non-dtrminism: gnralizs dtrminism, whr many nxt movs ar allowd at ach stp: Old Nw d:q S Q d:2 Q S 2 Q Computation bcoms a tr. Accptanc: $ a path from root (start stat) to som laf (a final stat) Ex: non-dtrministically accpt all strings whr th 7 th symbol bfor th nd is a b : b a,b a,b a,b a,b a,b a,b q 0 q 1 q 2 q 3 q 4 q 5 q 6 q 7 a,b Input: ababbaaa Accpt!
11 Finit Automata: Rviw Thorm: Non-dtrminism in FAs dosn t incras powr. Proof: by simulation: Construct all supr-stats, on pr ach stat subst. Nw supr-transition function jumps among supr-stats, simulating old transition function Initial supr stat ar thos containing old initial stat. Final supr stats ar thos containing old final stats. Rsulting DFA accpts th sam languag as original NFA, but can hav xponntially mor stats. Q: Why dosn t this work for PDAs?
12 Finit Automata: Rviw Not: Powrst construction gnralizs th cross-product construction. Mor gnral constructions ar possibl. EC: Lt HALF(L)={v $ v,w S * ' v = w and vw L} Show that HALF prsrvs rgularity. A two way FA can mov its had backwards on th input: d:q S Q {lft,right} EC: Show that two-way FA ar not mor powrful than ordinary on-way FA. -transitions: q i q j q i q j On supr-stat! Thorm: -transitions don t incras FA rcognition powr. Proof: Simulat -transitions FA without using -transitions. i.., considr -transitions to b a form of non-dtrminism.
13 Th movi Nxt (2007) Basd on th scinc fiction story Th Goldn Man by Philip Dick Prmis: a man with th supr powr of non-dtrminism! At any givn momnt his rality branchs into multipl dirctions, and h can choos th branch that h prfrs! Transition function!
14 Top-10 Rasons to Study Non-dtrminism 1. Hlps us undrstand th ubiquitous concpt of paralllism / concurrncy; 2. Illuminats th structur of problms; 3. Can hlp sav tim & ffort by solving intractabl problms mor fficintly; 4. Enabls vast, dp, and gnral studis of compltnss thoris; 5. Hlps xplain why vrifying proofs & solutions sms to b asir than constructing thm;
15 Why Study Non-dtrminism? 6. Gav ris to nw and novl mathmatical approachs, proofs, and analyss; 7. Robustly dcoupls / abstracts complxity from undrlying computational modls; 8. Givs disciplind tchniqus for idntifying hardst problms / languags; 9. Forgd nw unifications btwn computr scinc, math & logic; 10. Non-dtrminism is intrsting fun, and cool!
16 Rgular Exprssions Rgular xprssions ar dfind rcursivly as follows: Ø mpty st q 0 {} trivial languag {x} " x S singlton languag q 0 q 0 x q 1 Inductivly, if R and S ar rgular xprssions, thn so ar: (R+S) union M 1 RS concatnation M 2 M 2 M 1 Compositions! R * Kln closur Exampls: aa(a+b) * bb (a+b) * b(a+b) * a(a+b) * Thorm: Any rgular xprssion is accptd by som FA. M
17 Rgular Exprssions A FA for a rgular xprssions can b built by composition: Ex: all strings ovr S={a,b} whr $ a b prcding an a (a+b) * b(a+b) * a(a+b) * = (a+b) * ba(a+b) * b a b a b a Why? b a b a b a b a b a b a b a b a b a Rmov prvious start/final stats
18 FA Minimization Ida: Equivalnt stats can b mrgd: b a a,b a,b b a b a b a b a b a b a b a a,b a,b b a a,b a,b
19 FA Minimization Thorm [Hopcroft 1971]: th numbr N of stats in a FA can b minimizd within tim O(N log N). Basd on arlir work [Huffman 1954] & [Moor 1956]. Conjctur: Minimizing th numbr of stats in a nondtrministic FA can not b don in polynomial tim. Thorm: Minimizing th numbr of stats in a pushdown automaton (or TM) is undcidabl. Projct ida: implmnt a finit automaton minimization tool. Try to dsign it to run rasonably fficintly. Considr also including: A rgular-xprssion-to-fa transformr, A non-dtrministic-to-dtrministic FA convrtr.
20 FAs and Rgular Exprssions Thorm: Any FA accpts a languag dnotd by som RE. Proof: Us gnralizd finit automata whr a transition can b a rgular xprssion (not just a symbol), and: Only 1 supr start stat and 1 (sparat) supr final stat. Each stat has transitions to all othr stats (including itslf), xcpt th supr start stat, with no incoming transitions, and th supr final stat, which has no outgoing transitions. M M Ø Ø Ø Ø Ø M Ø Ø Ø Ø Original FA M Gnralizd FA (GFA) M
21 FAs and Rgular Exprssions Now rduc th siz of th GFA by on stat at ach stp. A transformation stp is as follows: q i P q j q i P q j q i P + RS * T q j R S q T RS * T Such a transformation stp is always possibl, until th GFA has only two stats, th supr-start and supr-final stats: M P Labl of last rmaining transition is th rgular xprssion corrsponding to th languag of th original FA! Corollary: FAs and REs dnot th sam class of languags.
22 R+S = S+R Rgular Exprssions Idntitis R(ST) = (RS)T R(S+T) = RS+RT (R+S)T = RT+ST Ø * = * = R+Ø = Ø+R = R R = R = R (R * ) * = R * ( + R) * = R * (R * S * ) * = (R+S) * R+ R RØ R
23 Dcidabl Finit Automata Problms Df: A problm is dcidabl if $ an algorithm which can dtrmin (in finit tim) th corrct answr for any instanc. Givn a finit automata M 1 and M 2 : Q 1 : Is L(M 1 ) = Ø? Hint: graph rachability Q 2 : Is L(M 2 ) infinit? Hint: cycl dtction Q 3 : Is L(M 1 ) = L(M 2 )? Hint: considr L 1 -L 2 and L 2 -L 1 M M $? $? S * -{} Ø Ø
24 Rgular Exprssion Minimization Problm: find smallst quivalnt rgular xprssion Dcidabl (why?) Hard: PSPACE-complt Turing Machin Minimization Problm: find smallst quivalnt Turing machin Not dcidabl (why?) Not vn rcognizabl (why?)
25
26
27
28
29
30 Contxt-Fr Grammars: Rviw Basic ida: st of production ruls inducs a languag Finit st of variabls: V = {V 1, V 2,..., V k } Finit st of trminals: T = {t 1, t 2,..., t j } Finit st of productions: P Start symbol: Productions: V i D whr V i V and D (V T)* Applying V i D to av i b yilds: a Db Not: productions do not dpnd on contxt - hnc th nam contxt fr! S
31 Contxt-Fr Grammars: Rviw Df: A languag is contxt-fr if it is accptd by som contxt-fr grammar. Thorm: All rgular languags ar contxt-fr. Thorm: Som contxt-fr languags ar not rgular. Ex: {0 n 1 n n > 0} Proof by pumping argumnt: long strings in a rgular languag contain a pumpabl substring. $ N ' "z L, z $ u,v,w S* ' z=uvw, uv, v 1, uv i w L " i Thorm: Som languags ar not contxt-fr. Ex: {0 n 1 n 2 n n > 0} Proof by pumping argumnt for CFL s.
32 Ambiguity: Rviw Df: A grammar is ambiguous if som string in its languag has two non-isomorphic drivations. Thorm: Som contxt-fr grammars ar ambiguous. Ex: G 1 : S SS a Drivation 1: S SS aa Drivation 2: S SS SSS aa Df: A contxt-fr languag is inhrntly ambiguous if vry contxt-fr grammar for it is ambiguous. Thorm: Som contxt-fr languags ar inhrntly ambiguous (i.., no non-ambiguous CFG xists). Ex: {a n b n c m d m m>0, n>0} {a n b m c n d m m>0, n>0}
33 Exampl: dsign a contxt-fr grammar for strings rprsnting all wll-balancd parnthsis. Ida: crat ruls for gnrating nsting & juxtaposition. G 1 : S SS (S) Ex: S SS (S)(S) ()() S (S) ((S)) (()) S (S) (SS)... (()((())())) Q: Is G 1 ambiguous? Anothr grammar: G 2 : S (S)S Q: Is L(G 1 ) = L(G 2 )? Q: Is G 2 ambiguous?
34 Exampl : dsign a contxt-fr grammar that gnrats all valid rgular xprssions. Ida: mbdd th RE ruls in a grammar. G: S a for ach a S L S (S) SS S* S+S S S* (S)* (S+S)* (a+b)* S SS SSSS abs*b aba*a Q: Is G ambiguous?
35 Pushdown Automata: Rviw Basic ida: a pushdown automaton is a finit automaton that can optionally writ to an unboundd stack. Finit st of stats: Q = {q 0, q 1, q 3,..., q k } q 1 Input alphabt: S Stack alphabt: G Transition function: d: Q (S {}) G 2 Q G* q i q j Initial stat: q 0 Q q 0 Final stats: F Q q k Pushdown automaton is M=(Q, S, G, d, q 0, F) Not: pushdown automata ar non-dtrministic!
36 Pushdown Automata: Rviw A pushdown automaton can us its stack as an unboundd but accss-controlld (last-in/first-out or LIFO) storag. A PDA accsss its stack using push and pop Stack & input alphabts may diffr. Input rad had only gos 1-way. Accptanc can b by final stat or by mpty-stack. Not: a PDA can b mad dtrministic by rstricting its transition function to uniqu nxt movs: d: Q (S {}) G Q G * M Input a b a stack
37 Pushdown Automata: Rviw Thorm: If a languag is accptd by som contxt-fr grammar, thn it is also accptd by som PDA. Thorm: If a languag is accptd by som PDA, thn it is also accptd by som contxt-fr grammar. Corrolary: A languag is contxt-fr iff it is also accptd by som pushdown automaton. I.E., contxt-fr grammars and PDAs hav quivalnt computation powr or xprssivnss capability.
38 Closur Proprtis of CFLs Thorm: Th contxt-fr languags ar closd undr union. Hint: Driv a nw grammar for th union. Thorm: Th CFLs ar closd undr Kln closur. Hint: Driv a nw grammar for th Kln closur. Thorm: Th CFLs ar closd undr with rgular langs. Hint: Simulat PDA and FA in paralll. Thorm: Th CFLs ar not closd undr intrsction. Hint: Find a countr xampl. Thorm: Th CFLs ar not closd undr complmntation. Hint: Us D Morgan s law.
39 Dcidabl PDA / CFG Problms Givn an arbitrary pushdown automata M (or CFG G) th following problms ar dcidabl (i.., hav algorithms): Q 1 : Is L(M) = Ø? Q 5 : Is L(G) = Ø? Q 2 : Is L(M) finit? Q 6 : Is L(G) finit? Q 3 : Is L(M) infinit? Q 7 : Is L(G) infinit? Q 4 : Is w L(M)? Q 8 : Is w L(G)?
40 Undcidabl PDA / CFG Problms Thorm: th following ar undcidabl (i.., thr xist no algorithms to answr ths qustions): Q: Is PDA M minimal? Q: Ar PDAs M 1 and M 2 quivalnt? Q: Is CFG G minimal? Q: Is CFG G ambiguous? Q: Is L(G 1 ) = L(G 2 )? Q: Is L(G 1 ) L(G 2 ) = Ø? Q: Is CFL L inhrntly ambiguous?
41 PDA Enhancmnts Thorm: 2-way PDAs ar mor powrful than 1-way PDAs. Hint: Find an xampl non-cfl accptd by a 2-way PDA. Thorm: 2-stack PDAs ar mor powrful than 1-stack PDAs. Hint: Find an xampl non-cfl accptd by a 2-stack PDA. Thorm: 1-quu PDAs ar mor powrful than 1-stack PDAs. Hint: Find an xampl non-cfl accptd by a 1-quu PDA. Thorm: 2-had PDAs ar mor powrful than 1-had PDAs. Hint: Find an xampl non-cfl accptd by a 2-had PDA. Thorm: Non-dtrminism incrass th powr of PDAs. Hint: Find a CFL not accptd by any dtrministic PDA.
42 Turing Machins: Rviw Basic ida: a Turing machin is a finit automaton that can optionally writ to an unboundd tap. Finit st of stats: Q = {q 0, q 1, q 3,..., q k } Tap alphabt: Blank symbol: Input alphabt: Transition function: Initial stat: Final stats: G b G S G {b} d: (Q F) G Q G {L,R} q 0 Q F Q Turing machin is M=(Q, G, b, S, d, q 0, F) q 1 q i q 0 q k q j
43 A Turing machin can us its tap as an unboundd storag but rads / writs only at had position. Initially th ntir tap is blank, xcpt th input portion Rad / writ had gos lft / right with ach transition A Turing machin is usually dtrministic Input string accptanc is by final stat(s) M Turing Machins: Rviw Input b b
44 Turing Machin Enhancmnts Largr alphabt: old: Σ={0,1} nw: Σ ={a,b,c,d} Ida: Encod largr alphabt using smallr on. Encoding xampl: a=00, b=01, c=10, d=11 b a d c a old: δ b nw: δ' 0 1
45 Turing Machin Enhancmnts Doubl-sidd infinit tap: Ida: Fold into a normal singl-sidd infinit tap old: δ L/R nw: δ' L/R L/R L/R R/L R/L
46 Turing Machin Enhancmnts Multipl hads: b b a b a b b a a Ida: Mark hads locations on tap and simulat bb b b A a b a b B b Aa a Modifid δ' procsss ach virtual had indpndntly: Each mov of δ is simulatd by a long scan & updat δ' updats & marks all virtual had positions
47 Turing Machin Enhancmnts Multipl taps: Ida: Intrlac multipl taps into a singl tap Modifid δ' procsss ach virtual tap indpndntly: Each mov of δ is simulatd by a long scan & updat δ' updats R/W had positions on all virtual taps
48 Turing Machin Enhancmnts Two-dimnsional tap: Ida: Flattn 2-D tap into a 1-D tap $ $ $ Modifid 1-D δ' simulats th original 2-D δ: Lft/right δ movs: δ' movs horizontally This is how compilrs implmnt 2D arrays! Up/down δ movs: δ' jumps btwn tap sctions
49 Turing Machin Enhancmnts Non-dtrminism: Ida: Paralll-simulat non-dtrministic thrads $ $ $ Modifid dtrministic δ' simulats th original ND δ: Each ND mov by δ spawns anothr indpndnt thrad All currnt thrads ar simulatd in paralll
50 Turing Machin Enhancmnts Combinations: ND H l l o W o r l d! 9 Π λ α τ ω ν Ida: Enhancmnts ar indpndnt (and commutativ with rspct to prsrving th languag rcognizd). Thorm: Combinations of nhancmnts do not incras th powr of Turing machins.
51 Turing -Rcognizabl vs. -Dcidabl w Input Accpt & halt Rjct & halt Df: A languag is Turing-dcidabl iff it is xactly th st of strings accptd by som always-halting TM. w Σ * = a b aa ab ba bb aaa aab aba abb baa bab bba bbbaaaa L(M) = { a, aa, aaa, aaaa } M(w) Not: M must always halt on vry input. Nvr runs forvr
52 Turing -Rcognizabl vs. -Dcidabl w Input Accpt & halt Rjct & halt Df: A languag is Turing-rcognizabl iff it is xactly th st of strings accptd by som Turing machin. w Σ * = a b aa ab ba bb aaa aab aba abb baa bab bba bbbaaaa L(M) = { a, aa, aaa, aaaa } M(w) Run forvr Not: M can run forvr on an input, which is implicitly a rjct (sinc it is not an accpt).
53 Rcognition vs. Enumration Df: Dcidabl mans Turing-dcidabl Rcognizabl mans Turing-rcognizabl Thorm: Evry dcidabl languag is also rcognizabl. Thorm: Som rcognizabl languags ar not dcidabl. Ex: Th halting problm is rcognizabl but not dcidabl. Not: Dcidability is a spcial cas of rcognizability. Not: It is asir to rcogniz than to dcid.
54 Famous Dcidrs A wrong dcision is bttr than indcision. I'm th dcidr, and I dcid what is bst.
55 Famous Dcidrs
56 Rcognition and Enumration Df: An numrator Turing machin for a languag L prints out prcisly all strings of L on its output tap. a $ a b $ b b a $ Not: Th ordr of numration may b arbitrary. Thorm: If a languag is dcidabl, it can b numratd in lxicographic ordr by som Turing machin. Thorm: If a languag can b numratd in lxicographic ordr by som TM, it is dcidabl.
57 Rcognition and Enumration Df: An numrator Turing machin for a languag L prints out prcisly all strings of L on its output tap. a $ a b $ b b a $ Not: Th ordr of numration may b arbitrary. Thorm: If a languag is rcognizabl, thn it can b numratd by som Turing machin. Thorm: If a languag can b numratd by som TM, thn it is rcognizabl.
58
59
60 Dcidability w Input Accpt & halt Rjct & halt Nvr runs forvr Df: A languag is Turing-dcidabl iff it is xactly th st of strings accptd by som always-halting TM. Thorm: Th finit languags ar dcidabl. Thorm: Th rgular languags ar dcidabl. Thorm: Th contxt-fr languags ar dcidabl.
61 A Simpl Exampl Lt S = {x 3 + y 3 + z 3 x, y, z Z } Q: Is S infinit? A: Ys, sinc S contains all cubs. Q: Is S Turing-rcognizabl? A: Ys, sinc dovtailing TM can numrat S. Q: Is S Turing-dcidabl? A: Unknown! Q: Is 29 S? A: Ys, sinc =29 Q: Is 30 S? A: Ys, sinc ( ) 3 +( ) 3 +( ) 3 =30 Q: Is 33 S? A: Unknown! Thorm [Matiyasvich, 1970]: Hilbrt s 10 th problm (1900), namly of dtrmining whthr a givn Diophantin (i.., multi-variabl polynomial) quation has any intgr solutions, is not dcidabl.
62 Closur Proprtis of Dcidabl Languags Thorm: Th dcidabl languags ar closd undr union. Hint: us simulation. Thorm: Th dcidabl languags ar closd undr. Hint: us simulation. Thorm: Th dcidabl langs ar closd undr complmnt. Hint: simulat and ngat. Thorm: Th dcidabl langs ar closd undr concatnation. Hint: guss-factor string and simulat. Thorm: Th dcidabl langs ar closd undr Kln star. Hint: guss-factor string and simulat.
63 Closur Proprtis of Rcognizabl Languags Thorm: Th rcognizabl languags ar closd undr union. Hint: us simulation. Thorm: Th rcognizabl languags ar closd undr. Hint: us simulation. Thorm: Th rcognizabl langs ar not closd undr compl. Hint: rduction from halting problm. Thorm: Th rcognizabl langs ar closd undr concat. Hint: guss-factor string and simulat. Thorm: Th rcognizabl langs ar closd undr Kln star. Hint: guss-factor string and simulat.
64 Rducibilitis Df: A languag A is rducibl to a languag B if $ computabl function/map ƒ: * * whr "w w A ƒ(w) B A ƒ w B ƒ(w) Not: ƒ is calld a rduction of A to B Dnotation: A B Intuitivly, A is no hardr than B
65 Rducibilitis Df: A languag A is rducibl to a languag B if $ computabl function/map ƒ: * * whr "w w A ƒ(w) B A ƒ w B ƒ(w) Thorm: If A B and B is dcidabl thn A is dcidabl. Thorm: If A B and A is undcidabl thn B is undcidabl. Not: b vry carful about th mapping dirction!
66 Rduction Exampl 1 Df: Lt H b th halting problm for TMs running on w= Dos TM M halt on? H = { <M> * M() halts } Thorm: H is not dcidabl. Proof: Rduction from th Halting Problm H: Givn an arbitrary TM M and input w, construct nw TM M that if it ran on input x, it would: x Ignor x M 1. Ovrwrit x with th fixd w on tap; 2. Simulat M on th fixd input w; 3. Accpt M accpts w. Simulat M on w If M(w) halts thn Not: M halts on (and on any x *) M halts on w. A dcidr (oracl) for H can thus b usd to dcid H! Sinc H is undcidabl, H must b undcidabl also. halt Not: M is not run!
67 Rduction Exampl 2 Df: Lt L Ø b th mptynss problm for TMs Is L(M) mpty? L Ø = { <M> * L(M) = Ø } Thorm: L Ø is not dcidabl. Proof: Rduction from th Halting Problm H: Givn an arbitrary TM M and input w, construct nw TM M that if it ran on input x, it would: x Ignor x M 1. Ovrwrit x with th fixd w on tap; 2. Simulat M on th fixd input w; 3. Accpt M accpts w. Not: M halts on vry x * M halts on w. Simulat M on w If M(w) halts thn A dcidr (oracl) for L Ø can thus b usd to dcid H! Sinc H is undcidabl, L Ø must b undcidabl also. halt Not: M is not run!
68 Rduction Exampl 3 Df: Lt L rg b th rgularity problm for TMs Is L(M) rgular? L rg = { <M> * L(M) is rgular } Thorm: L rg is not dcidabl. Proof: Rduction from th Halting Problm H: Givn an arbitrary TM M and input w, construct nw TM M that if it ran on input x, it would: x 1. Accpt if x 0 n 1 n 2. Ovrwrit x with th fixd w on tap; 3. Simulat M on th fixd input w; 4. Accpt M accpts w. Not: L(M )= * M halts on w L(M )=0 n 1 n M dos not halt on w Accpt if x 0 n 1 n Ignor x M Simulat M on w If M(w) halts thn A dcidr (oracl) for L rg can thus b usd to dcid H! halt Not: M is not run!
69 Ric s Thorm Df: Lt a proprty P b a st of rcognizabl languags Ex: P 1 ={L L is a dcidabl languag} P 2 ={L L is a contxt-fr languag} P 3 ={L L = L * } P 4 ={{}} P 5 = Ø P 6 ={L L is a rcognizabl languag} L is said to hav proprty P iff L P Ex: (a+b) * has proprty P 1, P 2, P 3 & P 6 but not P 4 or P 5 {ww R } has proprty P 1, P 2, & P 6 but not P 3, P 4 or P 5 Df: A proprty is trivial iff it is mpty or it contains all rcognizabl languags.
70 Thorm: Th two trivial proprtis ar dcidabl. Proof: P non = Ø x Ric s Thorm Ignor x Say no Stop M non no P all ={L L is a rcognizabl languag} M non dcids P non x Ignor x Say ys Stop M all ys M all dcids P all Q: What othr proprtis (othr than P non and P all ) ar dcidabl? A: Non!
71 Ric s Thorm Thorm [Ric, 1951]: All non-trivial proprtis of th Turing-rcognizabl languags ar not dcidabl. Proof: Lt P b a non-trivial proprty. Without loss of gnrality assum Ø P, othrwis substitut P s complmnt for P in th rmaindr of this proof. Slct L P (not that L Ø sinc Ø P), and lt M L rcogniz L (i.., L(M L )=L Ø ). Assum (towards contradiction) that $ som TM M P which dcids proprty P: Not: x can b.g., a TM dscription. x Dos th languag dnotd by <x> hav proprty P? M P ys no
72 Rduction stratgy: us M p to solv th halting problm. Rcall that L P, and lt M L rcogniz L (i.., L(M L )=L Ø). Givn an arbitrary TM M & string w, construct M : x M w Ric s Thorm M halt start M L What is th languag of M? L(M ) is ithr Ø or L(M L )=L If M halts on w thn L(M )=L(M L )= L If M dos not halt on w thn L(M )= Ø sinc M L nvr starts => M halts on w iff L(M ) has proprty P Oracl M P can dtrmin if L(M ) has proprty P, and thrby solv th halting problm, a contradiction! ys ys Dos th languag dnotd by <x> hav proprty P? M P ys no
73 Ric s Thorm Corollary: Th following qustions ar not dcidabl: givn a TM, is its languag L: Empty? Finit? Infinit? Co-finit? Rgular? Contxt-fr? Inhrntly ambiguous? Dcidabl? L= *? L contains an odd string? L contains a palindrom? L = {Hllo, World}? L is NP-complt? L is in PSPACE? Warning: Ric s thorm applis to proprtis (i.., sts of languags), not (dirctly to) TM s or othr objct typs!
74 Contxt-Snsitiv Grammars Problm: dsign a contxt-snsitiv grammar to accpt th (non-contxt-fr) languag {1 n $1 2n n 1} Ida: gnrat n 1 s to th lft & to th right of $; thn doubl n tims th # of 1 s on th right. S 1ND1E /* Bas cas; E marks nd-of-string */ N 1ND $ /* Loop: n 1 s and n D s; nd with $ */ D1 11D /* Each D doubls th 1 s on right */ DE E /* Th E cancls out th D s */ E ε /* Procss nds whn th E vanishs */
75 Exampl: Gnrating strings in {1 n $1 2n n 1} S 1ND1E D1 11D E ε N 1ND $ DE E S 1ND1E 11NDD1E 11ND11DE 111NDD11DE 111ND11D1DE 111N11D1D1DE 111N11D1D1E 111$11D1D1E 111$1111DD1E 111$1111D11DE 111$111111D1DE 111$ DDE 111$ DE 111$ E 111$ ε = 1 3 $1 8 = 1 3 $1 23
76
Formal Languages. S ={a,b} ababbaab L={a,aa,aaa, } aba =3 "w w e = e w = w ab ba=abba {1,2} {a,b, } ={1a,2a,1b,2b, } a 3 =aaa {0,1} 32
Formal Languags Alphabt: a finit st of symbols String: a finit squnc of symbols Languag: a (possibly ) st of strings String lngth: numbr of symbols in it Empty string: or ^ ( =0) String concatnation: w
More informationFinite Automata. d: Q S Q. Finite automaton is M=(Q, S, d, q 0, F) Ex: an FA that accepts all odd-length strings of zeros: q 0 q 1. q i. q k.
Finit Automt Bsic id: FA is mchin tht chngs stts whil procssing symols, on t tim. Finit st of stts: Q = {q 0, q 1, q 3,..., q k } Trnsition function: Initil stt: Finl stts: d: Q S Q q 0 Q F Q Finit utomton
More informationCS 6353 Compiler Construction, Homework #1. 1. Write regular expressions for the following informally described languages:
CS 6353 Compilr Construction, Homwork #1 1. Writ rgular xprssions for th following informally dscribd languags: a. All strings of 0 s and 1 s with th substring 01*1. Answr: (0 1)*01*1(0 1)* b. All strings
More informationPropositional Logic. Combinatorial Problem Solving (CPS) Albert Oliveras Enric Rodríguez-Carbonell. May 17, 2018
Propositional Logic Combinatorial Problm Solving (CPS) Albrt Olivras Enric Rodríguz-Carbonll May 17, 2018 Ovrviw of th sssion Dfinition of Propositional Logic Gnral Concpts in Logic Rduction to SAT CNFs
More informationCS 361 Meeting 12 10/3/18
CS 36 Mting 2 /3/8 Announcmnts. Homwork 4 is du Friday. If Friday is Mountain Day, homwork should b turnd in at my offic or th dpartmnt offic bfor 4. 2. Homwork 5 will b availabl ovr th wknd. 3. Our midtrm
More informationWeek 3: Connected Subgraphs
Wk 3: Connctd Subgraphs Sptmbr 19, 2016 1 Connctd Graphs Path, Distanc: A path from a vrtx x to a vrtx y in a graph G is rfrrd to an xy-path. Lt X, Y V (G). An (X, Y )-path is an xy-path with x X and y
More informationThat is, we start with a general matrix: And end with a simpler matrix:
DIAGON ALIZATION OF THE STR ESS TEN SOR INTRO DUCTIO N By th us of Cauchy s thorm w ar abl to rduc th numbr of strss componnts in th strss tnsor to only nin valus. An additional simplification of th strss
More information1 Minimum Cut Problem
CS 6 Lctur 6 Min Cut and argr s Algorithm Scribs: Png Hui How (05), Virginia Dat: May 4, 06 Minimum Cut Problm Today, w introduc th minimum cut problm. This problm has many motivations, on of which coms
More informationStrongly Connected Components
Strongly Connctd Componnts Lt G = (V, E) b a dirctd graph Writ if thr is a path from to in G Writ if and is an quivalnc rlation: implis and implis s quivalnc classs ar calld th strongly connctd componnts
More informationAbstract Interpretation: concrete and abstract semantics
Abstract Intrprtation: concrt and abstract smantics Concrt smantics W considr a vry tiny languag that manags arithmtic oprations on intgrs valus. Th (concrt) smantics of th languags cab b dfind by th funzcion
More informationCPSC 665 : An Algorithmist s Toolkit Lecture 4 : 21 Jan Linear Programming
CPSC 665 : An Algorithmist s Toolkit Lctur 4 : 21 Jan 2015 Lcturr: Sushant Sachdva Linar Programming Scrib: Rasmus Kyng 1. Introduction An optimization problm rquirs us to find th minimum or maximum) of
More informationSection 6.1. Question: 2. Let H be a subgroup of a group G. Then H operates on G by left multiplication. Describe the orbits for this operation.
MAT 444 H Barclo Spring 004 Homwork 6 Solutions Sction 6 Lt H b a subgroup of a group G Thn H oprats on G by lft multiplication Dscrib th orbits for this opration Th orbits of G ar th right costs of H
More informationEEO 401 Digital Signal Processing Prof. Mark Fowler
EEO 401 Digital Signal Procssing Prof. Mark Fowlr Dtails of th ot St #19 Rading Assignmnt: Sct. 7.1.2, 7.1.3, & 7.2 of Proakis & Manolakis Dfinition of th So Givn signal data points x[n] for n = 0,, -1
More informationLecture 4: Parsing. Administrivia
Adminitrivia Lctur 4: Paring If you do not hav a group, pla pot a rqut on Piazzza ( th Form projct tam... itm. B ur to updat your pot if you find on. W will aign orphan to group randomly in a fw day. Programming
More informationFSA. CmSc 365 Theory of Computation. Finite State Automata and Regular Expressions (Chapter 2, Section 2.3) ALPHABET operations: U, concatenation, *
CmSc 365 Thory of Computtion Finit Stt Automt nd Rgulr Exprssions (Chptr 2, Sction 2.3) ALPHABET oprtions: U, conctntion, * otin otin Strings Form Rgulr xprssions dscri Closd undr U, conctntion nd * (if
More informationRoadmap. XML Indexing. DataGuide example. DataGuides. Strong DataGuides. Multiple DataGuides for same data. CPS Topics in Database Systems
Roadmap XML Indxing CPS 296.1 Topics in Databas Systms Indx fabric Coopr t al. A Fast Indx for Smistructurd Data. VLDB, 2001 DataGuid Goldman and Widom. DataGuids: Enabling Qury Formulation and Optimization
More informationu x v x dx u x v x v x u x dx d u x v x u x v x dx u x v x dx Integration by Parts Formula
7. Intgration by Parts Each drivativ formula givs ris to a corrsponding intgral formula, as w v sn many tims. Th drivativ product rul yilds a vry usful intgration tchniqu calld intgration by parts. Starting
More informationAbstract Interpretation. Lecture 5. Profs. Aiken, Barrett & Dill CS 357 Lecture 5 1
Abstract Intrprtation 1 History On brakthrough papr Cousot & Cousot 77 (?) Inspird by Dataflow analysis Dnotational smantics Enthusiastically mbracd by th community At last th functional community... At
More informationSource code. where each α ij is a terminal or nonterminal symbol. We say that. α 1 α m 1 Bα m+1 α n α 1 α m 1 β 1 β p α m+1 α n
Adminitrivia Lctur : Paring If you do not hav a group, pla pot a rqut on Piazzza ( th Form projct tam... itm. B ur to updat your pot if you find on. W will aign orphan to group randomly in a fw day. Programming
More informationIn the previous two chapters, we clarified what it means for a problem to be decidable or undecidable.
Chaptr 7 Computational Complxity 7.1 Th Class P In th prvious two chaptrs, w clarifid what it mans for a problm to b dcidabl or undcidabl. In principl, if a problm is dcidabl, thn thr is an algorithm (i..,
More informationDerangements and Applications
2 3 47 6 23 Journal of Intgr Squncs, Vol. 6 (2003), Articl 03..2 Drangmnts and Applications Mhdi Hassani Dpartmnt of Mathmatics Institut for Advancd Studis in Basic Scincs Zanjan, Iran mhassani@iasbs.ac.ir
More informationRecall that by Theorems 10.3 and 10.4 together provide us the estimate o(n2 ), S(q) q 9, q=1
Chaptr 11 Th singular sris Rcall that by Thorms 10 and 104 togthr provid us th stimat 9 4 n 2 111 Rn = SnΓ 2 + on2, whr th singular sris Sn was dfind in Chaptr 10 as Sn = q=1 Sq q 9, with Sq = 1 a q gcda,q=1
More informationcycle that does not cross any edges (including its own), then it has at least
W prov th following thorm: Thorm If a K n is drawn in th plan in such a way that it has a hamiltonian cycl that dos not cross any dgs (including its own, thn it has at last n ( 4 48 π + O(n crossings Th
More informationConstruction of asymmetric orthogonal arrays of strength three via a replacement method
isid/ms/26/2 Fbruary, 26 http://www.isid.ac.in/ statmath/indx.php?modul=prprint Construction of asymmtric orthogonal arrays of strngth thr via a rplacmnt mthod Tian-fang Zhang, Qiaoling Dng and Alok Dy
More information6.1 Integration by Parts and Present Value. Copyright Cengage Learning. All rights reserved.
6.1 Intgration by Parts and Prsnt Valu Copyright Cngag Larning. All rights rsrvd. Warm-Up: Find f () 1. F() = ln(+1). F() = 3 3. F() =. F() = ln ( 1) 5. F() = 6. F() = - Objctivs, Day #1 Studnts will b
More informationSearching Linked Lists. Perfect Skip List. Building a Skip List. Skip List Analysis (1) Assume the list is sorted, but is stored in a linked list.
3 3 4 8 6 3 3 4 8 6 3 3 4 8 6 () (d) 3 Sarching Linkd Lists Sarching Linkd Lists Sarching Linkd Lists ssum th list is sortd, but is stord in a linkd list. an w us binary sarch? omparisons? Work? What if
More informationIntroduction to Arithmetic Geometry Fall 2013 Lecture #20 11/14/2013
18.782 Introduction to Arithmtic Gomtry Fall 2013 Lctur #20 11/14/2013 20.1 Dgr thorm for morphisms of curvs Lt us rstat th thorm givn at th nd of th last lctur, which w will now prov. Thorm 20.1. Lt φ:
More informationProbability and Stochastic Processes: A Friendly Introduction for Electrical and Computer Engineers Roy D. Yates and David J.
Probability and Stochastic Procsss: A Frindly Introduction for Elctrical and Computr Enginrs Roy D. Yats and David J. Goodman Problm Solutions : Yats and Goodman,4.3. 4.3.4 4.3. 4.4. 4.4.4 4.4.6 4.. 4..7
More informationThe Equitable Dominating Graph
Intrnational Journal of Enginring Rsarch and Tchnology. ISSN 0974-3154 Volum 8, Numbr 1 (015), pp. 35-4 Intrnational Rsarch Publication Hous http://www.irphous.com Th Equitabl Dominating Graph P.N. Vinay
More informationUNTYPED LAMBDA CALCULUS (II)
1 UNTYPED LAMBDA CALCULUS (II) RECALL: CALL-BY-VALUE O.S. Basic rul Sarch ruls: (\x.) v [v/x] 1 1 1 1 v v CALL-BY-VALUE EVALUATION EXAMPLE (\x. x x) (\y. y) x x [\y. y / x] = (\y. y) (\y. y) y [\y. y /
More informationBasic Polyhedral theory
Basic Polyhdral thory Th st P = { A b} is calld a polyhdron. Lmma 1. Eithr th systm A = b, b 0, 0 has a solution or thr is a vctorπ such that π A 0, πb < 0 Thr cass, if solution in top row dos not ist
More informationCOHORT MBA. Exponential function. MATH review (part2) by Lucian Mitroiu. The LOG and EXP functions. Properties: e e. lim.
MTH rviw part b Lucian Mitroiu Th LOG and EXP functions Th ponntial function p : R, dfind as Proprtis: lim > lim p Eponntial function Y 8 6 - -8-6 - - X Th natural logarithm function ln in US- log: function
More informationCOUNTING TAMELY RAMIFIED EXTENSIONS OF LOCAL FIELDS UP TO ISOMORPHISM
COUNTING TAMELY RAMIFIED EXTENSIONS OF LOCAL FIELDS UP TO ISOMORPHISM Jim Brown Dpartmnt of Mathmatical Scincs, Clmson Univrsity, Clmson, SC 9634, USA jimlb@g.clmson.du Robrt Cass Dpartmnt of Mathmatics,
More informationECE602 Exam 1 April 5, You must show ALL of your work for full credit.
ECE62 Exam April 5, 27 Nam: Solution Scor: / This xam is closd-book. You must show ALL of your work for full crdit. Plas rad th qustions carfully. Plas chck your answrs carfully. Calculators may NOT b
More informationTheory of Computation
Fall 2002 (YEN) Theory of Computation Midterm Exam. Name:... I.D.#:... 1. (30 pts) True or false (mark O for true ; X for false ). (Score=Max{0, Right- 1 2 Wrong}.) (1) X... If L 1 is regular and L 2 L
More informationProblem Set 6 Solutions
6.04/18.06J Mathmatics for Computr Scinc March 15, 005 Srini Dvadas and Eric Lhman Problm St 6 Solutions Du: Monday, March 8 at 9 PM in Room 3-044 Problm 1. Sammy th Shark is a financial srvic providr
More informationA False History of True Concurrency
A Fals History of Tru Concurrncy Javir Esparza Sofwar Rliability and Scurity Group Institut for Formal Mthods in Computr Scinc Univrsity of Stuttgart. Th arly 6s. 2 Abstract Modls of Computation in th
More informationThe Matrix Exponential
Th Matrix Exponntial (with xrciss) by D. Klain Vrsion 207.0.05 Corrctions and commnts ar wlcom. Th Matrix Exponntial For ach n n complx matrix A, dfin th xponntial of A to b th matrix A A k I + A + k!
More informationBifurcation Theory. , a stationary point, depends on the value of α. At certain values
Dnamic Macroconomic Thor Prof. Thomas Lux Bifurcation Thor Bifurcation: qualitativ chang in th natur of th solution occurs if a paramtr passs through a critical point bifurcation or branch valu. Local
More informationEstimation of apparent fraction defective: A mathematical approach
Availabl onlin at www.plagiarsarchlibrary.com Plagia Rsarch Library Advancs in Applid Scinc Rsarch, 011, (): 84-89 ISSN: 0976-8610 CODEN (USA): AASRFC Estimation of apparnt fraction dfctiv: A mathmatical
More informationHigher order derivatives
Robrto s Nots on Diffrntial Calculus Chaptr 4: Basic diffrntiation ruls Sction 7 Highr ordr drivativs What you nd to know alrady: Basic diffrntiation ruls. What you can larn hr: How to rpat th procss of
More information(Upside-Down o Direct Rotation) β - Numbers
Amrican Journal of Mathmatics and Statistics 014, 4(): 58-64 DOI: 10593/jajms0140400 (Upsid-Down o Dirct Rotation) β - Numbrs Ammar Sddiq Mahmood 1, Shukriyah Sabir Ali,* 1 Dpartmnt of Mathmatics, Collg
More informationSearch sequence databases 3 10/25/2016
Sarch squnc databass 3 10/25/2016 Etrm valu distribution Ø Suppos X is a random variabl with probability dnsity function p(, w sampl a larg numbr S of indpndnt valus of X from this distribution for an
More informationSCHUR S THEOREM REU SUMMER 2005
SCHUR S THEOREM REU SUMMER 2005 1. Combinatorial aroach Prhas th first rsult in th subjct blongs to I. Schur and dats back to 1916. On of his motivation was to study th local vrsion of th famous quation
More informationSECTION where P (cos θ, sin θ) and Q(cos θ, sin θ) are polynomials in cos θ and sin θ, provided Q is never equal to zero.
SETION 6. 57 6. Evaluation of Dfinit Intgrals Exampl 6.6 W hav usd dfinit intgrals to valuat contour intgrals. It may com as a surpris to larn that contour intgrals and rsidus can b usd to valuat crtain
More informationBINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES
BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES DONALD M. DAVIS Abstract. If p is a prim (implicit in notation and n a positiv intgr, lt ν(n dnot th xponnt of p in n, and U(n n/p ν(n, th unit
More informationThus, because if either [G : H] or [H : K] is infinite, then [G : K] is infinite, then [G : K] = [G : H][H : K] for all infinite cases.
Homwork 5 M 373K Solutions Mark Lindbrg and Travis Schdlr 1. Prov that th ring Z/mZ (for m 0) is a fild if and only if m is prim. ( ) Proof by Contrapositiv: Hr, thr ar thr cass for m not prim. m 0: Whn
More informationQuasi-Classical States of the Simple Harmonic Oscillator
Quasi-Classical Stats of th Simpl Harmonic Oscillator (Draft Vrsion) Introduction: Why Look for Eignstats of th Annihilation Oprator? Excpt for th ground stat, th corrspondnc btwn th quantum nrgy ignstats
More informationMATH 319, WEEK 15: The Fundamental Matrix, Non-Homogeneous Systems of Differential Equations
MATH 39, WEEK 5: Th Fundamntal Matrix, Non-Homognous Systms of Diffrntial Equations Fundamntal Matrics Considr th problm of dtrmining th particular solution for an nsmbl of initial conditions For instanc,
More informationCalculus concepts derivatives
All rasonabl fforts hav bn mad to mak sur th nots ar accurat. Th author cannot b hld rsponsibl for any damags arising from th us of ths nots in any fashion. Calculus concpts drivativs Concpts involving
More informationThe Matrix Exponential
Th Matrix Exponntial (with xrciss) by Dan Klain Vrsion 28928 Corrctions and commnts ar wlcom Th Matrix Exponntial For ach n n complx matrix A, dfin th xponntial of A to b th matrix () A A k I + A + k!
More informationEXST Regression Techniques Page 1
EXST704 - Rgrssion Tchniqus Pag 1 Masurmnt rrors in X W hav assumd that all variation is in Y. Masurmnt rror in this variabl will not ffct th rsults, as long as thy ar uncorrlatd and unbiasd, sinc thy
More informationThe van der Waals interaction 1 D. E. Soper 2 University of Oregon 20 April 2012
Th van dr Waals intraction D. E. Sopr 2 Univrsity of Orgon 20 pril 202 Th van dr Waals intraction is discussd in Chaptr 5 of J. J. Sakurai, Modrn Quantum Mchanics. Hr I tak a look at it in a littl mor
More informationFirst derivative analysis
Robrto s Nots on Dirntial Calculus Chaptr 8: Graphical analysis Sction First drivativ analysis What you nd to know alrady: How to us drivativs to idntiy th critical valus o a unction and its trm points
More information10. Limits involving infinity
. Limits involving infinity It is known from th it ruls for fundamntal arithmtic oprations (+,-,, ) that if two functions hav finit its at a (finit or infinit) point, that is, thy ar convrgnt, th it of
More informationGeneral Notes About 2007 AP Physics Scoring Guidelines
AP PHYSICS C: ELECTRICITY AND MAGNETISM 2007 SCORING GUIDELINES Gnral Nots About 2007 AP Physics Scoring Guidlins 1. Th solutions contain th most common mthod of solving th fr-rspons qustions and th allocation
More informationObjective Mathematics
x. Lt 'P' b a point on th curv y and tangnt x drawn at P to th curv has gratst slop in magnitud, thn point 'P' is,, (0, 0),. Th quation of common tangnt to th curvs y = 6 x x and xy = x + is : x y = 8
More informationCOMPUTER GENERATED HOLOGRAMS Optical Sciences 627 W.J. Dallas (Monday, April 04, 2005, 8:35 AM) PART I: CHAPTER TWO COMB MATH.
C:\Dallas\0_Courss\03A_OpSci_67\0 Cgh_Book\0_athmaticalPrliminaris\0_0 Combath.doc of 8 COPUTER GENERATED HOLOGRAS Optical Scincs 67 W.J. Dallas (onday, April 04, 005, 8:35 A) PART I: CHAPTER TWO COB ATH
More informationPushdown Automata. Reading: Chapter 6
Pushdown Automata Reading: Chapter 6 1 Pushdown Automata (PDA) Informally: A PDA is an NFA-ε with a infinite stack. Transitions are modified to accommodate stack operations. Questions: What is a stack?
More informationBINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES. 1. Statement of results
BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES DONALD M. DAVIS Abstract. If p is a prim and n a positiv intgr, lt ν p (n dnot th xponnt of p in n, and u p (n n/p νp(n th unit part of n. If α
More informationThe graph of y = x (or y = ) consists of two branches, As x 0, y + ; as x 0, y +. x = 0 is the
Copyright itutcom 005 Fr download & print from wwwitutcom Do not rproduc by othr mans Functions and graphs Powr functions Th graph of n y, for n Q (st of rational numbrs) y is a straight lin through th
More informationFunction Spaces. a x 3. (Letting x = 1 =)) a(0) + b + c (1) = 0. Row reducing the matrix. b 1. e 4 3. e 9. >: (x = 1 =)) a(0) + b + c (1) = 0
unction Spacs Prrquisit: Sction 4.7, Coordinatization n this sction, w apply th tchniqus of Chaptr 4 to vctor spacs whos lmnts ar functions. Th vctor spacs P n and P ar familiar xampls of such spacs. Othr
More informationTheory of Computation (Classroom Practice Booklet Solutions)
Theory of Computation (Classroom Practice Booklet Solutions) 1. Finite Automata & Regular Sets 01. Ans: (a) & (c) Sol: (a) The reversal of a regular set is regular as the reversal of a regular expression
More informationOn spanning trees and cycles of multicolored point sets with few intersections
On spanning trs and cycls of multicolord point sts with fw intrsctions M. Kano, C. Mrino, and J. Urrutia April, 00 Abstract Lt P 1,..., P k b a collction of disjoint point sts in R in gnral position. W
More informationLecture 37 (Schrödinger Equation) Physics Spring 2018 Douglas Fields
Lctur 37 (Schrödingr Equation) Physics 6-01 Spring 018 Douglas Filds Rducd Mass OK, so th Bohr modl of th atom givs nrgy lvls: E n 1 k m n 4 But, this has on problm it was dvlopd assuming th acclration
More informationAddition of angular momentum
Addition of angular momntum April, 0 Oftn w nd to combin diffrnt sourcs of angular momntum to charactriz th total angular momntum of a systm, or to divid th total angular momntum into parts to valuat th
More informationA. Limits and Horizontal Asymptotes ( ) f x f x. f x. x "±# ( ).
A. Limits and Horizontal Asymptots What you ar finding: You can b askd to find lim x "a H.A.) problm is asking you find lim x "# and lim x "$#. or lim x "±#. Typically, a horizontal asymptot algbraically,
More information10. The Discrete-Time Fourier Transform (DTFT)
Th Discrt-Tim Fourir Transform (DTFT Dfinition of th discrt-tim Fourir transform Th Fourir rprsntation of signals plays an important rol in both continuous and discrt signal procssing In this sction w
More informationFORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY
15-453 FORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY REVIEW for MIDTERM 1 THURSDAY Feb 6 Midterm 1 will cover everything we have seen so far The PROBLEMS will be from Sipser, Chapters 1, 2, 3 It will be
More informationSquare of Hamilton cycle in a random graph
Squar of Hamilton cycl in a random graph Andrzj Dudk Alan Friz Jun 28, 2016 Abstract W show that p = n is a sharp thrshold for th random graph G n,p to contain th squar of a Hamilton cycl. This improvs
More informationThe second condition says that a node α of the tree has exactly n children if the arity of its label is n.
CS 6110 S14 Hanout 2 Proof of Conflunc 27 January 2014 In this supplmntary lctur w prov that th λ-calculus is conflunt. This is rsult is u to lonzo Church (1903 1995) an J. arkly Rossr (1907 1989) an is
More informationThere is an arbitrary overall complex phase that could be added to A, but since this makes no difference we set it to zero and choose A real.
Midtrm #, Physics 37A, Spring 07. Writ your rsponss blow or on xtra pags. Show your work, and tak car to xplain what you ar doing; partial crdit will b givn for incomplt answrs that dmonstrat som concptual
More information10. EXTENDING TRACTABILITY
Coping with NP-compltnss 0. EXTENDING TRACTABILITY ining small vrtx covrs solving NP-har problms on trs circular arc covrings vrtx covr in bipartit graphs Q. Suppos I n to solv an NP-complt problm. What
More informationAuthor: Vivek Kulkarni ( )
Author: Vivek Kulkarni ( vivek_kulkarni@yahoo.com ) Chapter-3: Regular Expressions Solutions for Review Questions @ Oxford University Press 2013. All rights reserved. 1 Q.1 Define the following and give
More informationAddition of angular momentum
Addition of angular momntum April, 07 Oftn w nd to combin diffrnt sourcs of angular momntum to charactriz th total angular momntum of a systm, or to divid th total angular momntum into parts to valuat
More information4. (5a + b) 7 & x 1 = (3x 1)log 10 4 = log (M1) [4] d = 3 [4] T 2 = 5 + = 16 or or 16.
. 7 7 7... 7 7 (n )0 7 (M) 0(n ) 00 n (A) S ((7) 0(0)) (M) (7 00) 8897 (A). (5a b) 7 7... (5a)... (M) 7 5 5 (a b ) 5 5 a b (M)(A) So th cofficint is 75 (A) (C) [] S (7 7) (M) () 8897 (A) (C) [] 5. x.55
More informationHomework #3. 1 x. dx. It therefore follows that a sum of the
Danil Cannon CS 62 / Luan March 5, 2009 Homwork # 1. Th natural logarithm is dfind by ln n = n 1 dx. It thrfor follows that a sum of th 1 x sam addnd ovr th sam intrval should b both asymptotically uppr-
More informationMutually Independent Hamiltonian Cycles of Pancake Networks
Mutually Indpndnt Hamiltonian Cycls of Pancak Ntworks Chng-Kuan Lin Dpartmnt of Mathmatics National Cntral Univrsity, Chung-Li, Taiwan 00, R O C discipl@ms0urlcomtw Hua-Min Huang Dpartmnt of Mathmatics
More informationChapter 10. The singular integral Introducing S(n) and J(n)
Chaptr Th singular intgral Our aim in this chaptr is to rplac th functions S (n) and J (n) by mor convnint xprssions; ths will b calld th singular sris S(n) and th singular intgral J(n). This will b don
More informationDealing with quantitative data and problem solving life is a story problem! Attacking Quantitative Problems
Daling with quantitati data and problm soling lif is a story problm! A larg portion of scinc inols quantitati data that has both alu and units. Units can sa your butt! Nd handl on mtric prfixs Dimnsional
More information22/ Breakdown of the Born-Oppenheimer approximation. Selection rules for rotational-vibrational transitions. P, R branches.
Subjct Chmistry Papr No and Titl Modul No and Titl Modul Tag 8/ Physical Spctroscopy / Brakdown of th Born-Oppnhimr approximation. Slction ruls for rotational-vibrational transitions. P, R branchs. CHE_P8_M
More informationFinding low cost TSP and 2-matching solutions using certain half integer subtour vertices
Finding low cost TSP and 2-matching solutions using crtain half intgr subtour vrtics Sylvia Boyd and Robrt Carr Novmbr 996 Introduction Givn th complt graph K n = (V, E) on n nods with dg costs c R E,
More informationu r du = ur+1 r + 1 du = ln u + C u sin u du = cos u + C cos u du = sin u + C sec u tan u du = sec u + C e u du = e u + C
Tchniqus of Intgration c Donald Kridr and Dwight Lahr In this sction w ar going to introduc th first approachs to valuating an indfinit intgral whos intgrand dos not hav an immdiat antidrivativ. W bgin
More informationcse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska
cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska LECTURE 14 SMALL REVIEW FOR FINAL SOME Y/N QUESTIONS Q1 Given Σ =, there is L over Σ Yes: = {e} and L = {e} Σ Q2 There are uncountably
More informationNEW APPLICATIONS OF THE ABEL-LIOUVILLE FORMULA
NE APPLICATIONS OF THE ABEL-LIOUVILLE FORMULA Mirca I CÎRNU Ph Dp o Mathmatics III Faculty o Applid Scincs Univrsity Polithnica o Bucharst Cirnumirca @yahoocom Abstract In a rcnt papr [] 5 th indinit intgrals
More informationMor Tutorial at www.dumblittldoctor.com Work th problms without a calculator, but us a calculator to chck rsults. And try diffrntiating your answrs in part III as a usful chck. I. Applications of Intgration
More informationAim To manage files and directories using Linux commands. 1. file Examines the type of the given file or directory
m E x. N o. 3 F I L E M A N A G E M E N T Aim To manag ils and dirctoris using Linux commands. I. F i l M a n a g m n t 1. il Examins th typ o th givn il or dirctory i l i l n a m > ( o r ) < d i r c t
More informationHydrogen Atom and One Electron Ions
Hydrogn Atom and On Elctron Ions Th Schrödingr quation for this two-body problm starts out th sam as th gnral two-body Schrödingr quation. First w sparat out th motion of th cntr of mass. Th intrnal potntial
More informationANALYSIS IN THE FREQUENCY DOMAIN
ANALYSIS IN THE FREQUENCY DOMAIN SPECTRAL DENSITY Dfinition Th spctral dnsit of a S.S.P. t also calld th spctrum of t is dfind as: + { γ }. jτ γ τ F τ τ In othr words, of th covarianc function. is dfind
More informationThe pn junction: 2 Current vs Voltage (IV) characteristics
Th pn junction: Currnt vs Voltag (V) charactristics Considr a pn junction in quilibrium with no applid xtrnal voltag: o th V E F E F V p-typ Dpltion rgion n-typ Elctron movmnt across th junction: 1. n
More informationINTEGRALS. Chapter 7. d dx. 7.1 Overview Let d dx F (x) = f (x). Then, we write f ( x)
Chptr 7 INTEGRALS 7. Ovrviw 7.. Lt d d F () f (). Thn, w writ f ( ) d F () + C. Ths intgrls r clld indfinit intgrls or gnrl intgrls, C is clld constnt of intgrtion. All ths intgrls diffr y constnt. 7..
More informationOn the irreducibility of some polynomials in two variables
ACTA ARITHMETICA LXXXII.3 (1997) On th irrducibility of som polynomials in two variabls by B. Brindza and Á. Pintér (Dbrcn) To th mmory of Paul Erdős Lt f(x) and g(y ) b polynomials with intgral cofficints
More informationGradebook & Midterm & Office Hours
Your commnts So what do w do whn on of th r's is 0 in th quation GmM(1/r-1/r)? Do w nd to driv all of ths potntial nrgy formulas? I don't undrstand springs This was th first lctur I actually larnd somthing
More informationLINEAR DELAY DIFFERENTIAL EQUATION WITH A POSITIVE AND A NEGATIVE TERM
Elctronic Journal of Diffrntial Equations, Vol. 2003(2003), No. 92, pp. 1 6. ISSN: 1072-6691. URL: http://jd.math.swt.du or http://jd.math.unt.du ftp jd.math.swt.du (login: ftp) LINEAR DELAY DIFFERENTIAL
More informationTHEORY OF COMPUTATION (AUBER) EXAM CRIB SHEET
THEORY OF COMPUTATION (AUBER) EXAM CRIB SHEET Regular Languages and FA A language is a set of strings over a finite alphabet Σ. All languages are finite or countably infinite. The set of all languages
More informationChapter 8: Electron Configurations and Periodicity
Elctron Spin & th Pauli Exclusion Principl Chaptr 8: Elctron Configurations and Priodicity 3 quantum numbrs (n, l, ml) dfin th nrgy, siz, shap, and spatial orintation of ach atomic orbital. To xplain how
More informationHarvard CS 121 and CSCI E-207 Lecture 10: CFLs: PDAs, Closure Properties, and Non-CFLs
Harvard CS 121 and CSCI E-207 Lecture 10: CFLs: PDAs, Closure Properties, and Non-CFLs Harry Lewis October 8, 2013 Reading: Sipser, pp. 119-128. Pushdown Automata (review) Pushdown Automata = Finite automaton
More information4.2 Design of Sections for Flexure
4. Dsign of Sctions for Flxur This sction covrs th following topics Prliminary Dsign Final Dsign for Typ 1 Mmbrs Spcial Cas Calculation of Momnt Dmand For simply supportd prstrssd bams, th maximum momnt
More informationFrom Elimination to Belief Propagation
School of omputr Scinc Th lif Propagation (Sum-Product lgorithm Probabilistic Graphical Modls (10-708 Lctur 5, Sp 31, 2007 Rcptor Kinas Rcptor Kinas Kinas X 5 ric Xing Gn G T X 6 X 7 Gn H X 8 Rading: J-hap
More informationSOME PARAMETERS ON EQUITABLE COLORING OF PRISM AND CIRCULANT GRAPH.
SOME PARAMETERS ON EQUITABLE COLORING OF PRISM AND CIRCULANT GRAPH. K VASUDEVAN, K. SWATHY AND K. MANIKANDAN 1 Dpartmnt of Mathmatics, Prsidncy Collg, Chnnai-05, India. E-Mail:vasu k dvan@yahoo.com. 2,
More information