0 Up votes0 Down votes

11 views5 pagescs

Mar 21, 2014

© Attribution Non-Commercial (BY-NC)

PDF, TXT or read online from Scribd

cs

Attribution Non-Commercial (BY-NC)

11 views

cs

Attribution Non-Commercial (BY-NC)

- AMORPHOUOS COMPUTING Examples, Mathematics and Theory, August2013
- SF Model
- RungeKuttaFehlberg
- Cook
- WH Science 11
- Pars Erg en Era Tor
- Boolean Algebra Example
- Sanlaville
- Lecture2
- on the complexity of schedule
- AIIDE 12 Constraints
- Lecture 13
- asgmnt
- Autonomy and Decision Making Homework Help
- OPTIM7.PDF
- Assignment 7
- Keyword Extraction From a Single Document Using Centrality Measures PREMI 2007
- sistema difuso
- Word Problem [MUST]
- net1.txt

You are on page 1of 5

Theorem: Every regular language is accepted by some nite automaton. Proof: We proceed by induction on the (length of/structure of) the description of the regular language. We need to show that is accepted by a nite automaton Easy: build an automaton where no input ever reaches a nal state is accepted by a nite automaton Easy: an automaton where the initial state accepts each x I is accepted by a nite automaton Easy: an automaton with two states, where x leads from s0 to a nal state. if A and B are accepted, so is AB Proof: Suppose that MA = (SA, I, fA, sA, FA) accepts A and MB = (SB , I, fB , sB , FB ) accepts B . Suppose that MA and MB and NFAs, and SA and SB are disjoint (without loss of generality). Idea: We hook MA and MB together.

1

+ Let NFS MAB = (SA SB , I, fAB , sA, FB ), where FB FA if B ; + FB = F otherwise B t fAB (s, i) if either s SA and t fA(s), or s SB and t fB (s), or s FA and t fB (sB ).

Idea: given input xy AB , the machine guesses when to switch from running MA to running MB . MAB accepts AB . if A and B are accepted, so is A B . MAB = (SASB {s0}, I, fAB , s0, FAB ), where s0 is a new state, not in SA SB fA(s) if s SA f ( s ) if s SB fAB (s) = B f (s ) f (s ) if s = s A A B B 0 FA FB {s0 } if A B FAB = F otherwise. A FB MAB accepts A B .

if A is accepted, so is A. MA = (SA {s0}, I, fA , s0, FA {s0}), where s0 is a new state, not in SA; f (s) if s SA FA; A f ( s ) f ( s ) if s FA; fA (s) = A A A f (s ) if s = s0 A A MA accepts A .

A Non-Regular Language

Not every language is regular (which means that not every language can be accepted by a nite automaton). Theorem: L = {0n1n : n = 0, 1, 2, . . .} is not regular. Proof: Suppose, by way of contradiction, that L is regular. Then there is a DFA M = (S, {0, 1}, f, s0, F ) that accepts L. Suppose that M has N states. Let s0, . . . , s2N be the set of states that M goes through on input 0N 1N Thus f (si, 0) = si+1 for i = 0, . . . , N . Since M has N states, by the pigeonhole principle (remember that?), at least two of s0, . . . , sN must be the same. Suppose its si and sj , where i < j , and j i = t. Claim: M accepts 0N 0t1N , and 0N 02t1N , ON 03t1N . Proof: Starting in s0, Oi brings the machine to si; another 0t bring the machine back to si (since sj = si+t = si); another 0t bring machine back to si again. After going around the loop for a while, the can continue to sN and accept.

The techniques of the previous proof generalize. If M is a DFA and x is a string accepted by M such that |x| |S | |S | is the number of states; |x| is the length of x then there are strings u, v , w such that x = uvw, |uv | |S |, |v | 1, uv iw is accepted by M , for i = 0, 1, 2, . . .. The proof is the same as on the previous slide. x was 0n1n, u = 0i, v = 0t, w = 0N ti1N . We can use the Pumping Lemma to show that many langauges are not regular {1

n2

Finite automata are very simple machines. They have no memory Roughly speaking, they cant count beyond the number of states they have. Pushdown automata have states and a stack which provides unlimited memory. They can recognize all languages generated by contextfree grammars (CFGs) CFGs are typically used to characterize the syntax of programming languages They can recognize the language {0n1n : n = 0, 1, 2, . . .}, but not the language L = {0n1n2n : n = 0, 1, 2, . . .} Linear bounded automata can recognize L . More generally, they can recognize context-sensitive grammars (CSGs) CSGs are (almost) good enough to characterize the grammar of real langugaes (like English)

: n = 0, 1, 2, . . .}: homework

Most general of all: Turing machine (TM) Given a computable language, there is a TM that accepts it. This is essentially how we dene computability. If youre interested in these issues, take CS 3810!

Coverage of Final

everything covered by the rst prelim emphasis on more recent material Chapter 4: Fundamental Counting Methods Permutations and combinations Combinatorial identities Pascals triangle Binomial Theorem (but not multinomial theorem) Balls and urns Inclusion-exclusion Pigeonhole principle Chapter 6: Probability: 6.16.5 (but not inverse binomial distribution) basic denitions: probability space, events conditional probability, independence, Bayes Thm. random variables uniform and binomial distribution expected value and variance

Chapter 7: Logic: 7.17.4, 7.6, 7.7; *not* 7.5 translating from English to propositional (or rstorder) logic truth tables and axiomatic proofs algorithm verication rst-order logic Chapter 3: Graphs and Trees basic terminology: digraph, dag, degree, multigraph, path, connected component, clique Eulerian and Hamiltonian paths algorithm for telling if graph has Eulerian path BFS and DFS bipartite graphs graph coloring and chromatic number graph isomorphism Finite State Automata describing nite state automata regular langauges and nite state automata nondeterministic vs. deterministic automata pumping lemma (understand what its saying)

9

Some Bureuacracy

The nal is on Friday, May 15, 2-4:30 PM, in Olin 155 If you have a conict and havent told me, let me know now Also tell me the courses and professors involved (with emails) Also tell the other professors Oce hours go on as usual during study week, but check the course web site soon. There may be small changes to accommodate the TAs exams There will be two review sessions: May 12 (7 PM) and May 13 (4:45)

10

Optimization: Understand which improvements are worth it. Probabilistic methods: Flipping a coin can be surprisingly helpful!

Counting: Count without counting (combinatorics) Induction: Recognize it in all its guises. Exemplication: Find a sense in which you can try out a problem or solution on small examples. Abstraction: Abstract away the inessential features of a problem. One possible way: represent it as a graph Modularity: Decompose a complex problem into simpler subproblems. Representation: Understand the relationships between dierent possible representations of the same information or idea. Graphs vs. matrices vs. relations Renement: The best solutions come from a process of repeatedly rening and inventing alternative solutions. Toolbox: Build up your vocabulary of abstract structures.

11

12

Suppose we have a random graph with n vertices. How likely is it to be connected? What is a random graph? If it has n vertices, there are C (n, 2) possible edges, and 2C (n,2) possible graphs. What fraction of them is connected? One way of thinking about this. Build a graph using a random process, that puts each edge in with probability 1/2. Given three vertices a, b, and c, whats the probability that there is an edge between a and b and between b and c? 1/4 What is the probability that there is no path of length 2 between a and c? (3/4)n2 What is the probability that there is a path of length 2 between a and c? 1 (3/4)n2 What is the probability that there is a path of length 2 between a and every other vertex? > (1(3/4)n2)n1

13

Now use the binomial theorem to compute (1(3/4)n2)n1 (1 (3/4)n2)n1 = 1 (n 1)(3/4)n2 + C (n 1, 2)(3/4)2(n2) + For suciently large n, this will be (just about) 1. Bottom line: If n is large, then it is almost certain that a random graph will be connected. Theorem: [Fagin, 1976] If P is any property expressible in rst-order logic, it is either true in almost all graphs, or false in almost all graphs. This is called a 0-1 law.

14

Suppose you wanted to query a database. How do you do it? Modern database query language date back to SQL (structured query language), and are all based on rst-order logic. The idea goes back to Ted Codd, who invented the notion of relational databases. Suppose youre a travel agent and want to query the airline database about whether there are ights from Ithaca to Santa Fe. How are cities and ights between them represented? How do we form this query? Youre actually asking whether there is a path from Ithaca to Santa Fe in the graph. This fact cannot be expressed in rst-order logic!

(No details here; just a rough sketch of the ideas. Take CS 3810/4820 if you want more.) NP = nondeterministic polynomial time a language (set of strings) L is in NP if, for each x L, you can guess a witness y showing that x L and quickly (in polynomial time) verify that its correct. Examples: Does a graph have a Hamiltonian path? guess a Hamiltonian path Is a formula satisable? guess a satisfying assignment Is there a schedule that satises certain constraints? ... Formally, L is in NP if there exists a language L such that 1. x L i there exists a y such that (x, y ) L , and 2. checking if (x, y ) L can be done in polynomial time

15

16

NP-completeness

A problem is NP-hard if every NP problem can be reduced to it. A problem is NP-complete if it is in NP and NP-hard Intuitively, if it is one of the hardest problems in NP. There are lots of problems known to be NP-complete If any NP complete problem is doable in polynomial time, then they all are. Hamiltonian path satisability scheduling ... If you can prove P = NP, youll get a Turing award.

17

- AMORPHOUOS COMPUTING Examples, Mathematics and Theory, August2013Uploaded byW Richard Stark
- SF ModelUploaded bybekdi
- RungeKuttaFehlbergUploaded byDante Góngora Galdos
- CookUploaded byCường Phạm Hùng
- WH Science 11Uploaded byAnonymous 1gbsuaafdd
- Pars Erg en Era TorUploaded byhackiftekhar
- Boolean Algebra ExampleUploaded byBiswajit Sarkar
- SanlavilleUploaded bySyed Nasir Shah Gillani
- Lecture2Uploaded bySoumya Ranjan
- on the complexity of scheduleUploaded byYeonju Eun
- AIIDE 12 ConstraintsUploaded byleif1201
- Lecture 13Uploaded byshekhar.mnnit
- asgmntUploaded bys_hahrizal
- Autonomy and Decision Making Homework HelpUploaded byassignmentpedia
- OPTIM7.PDFUploaded byteknikpembakaran2013
- Assignment 7Uploaded byravichandrasadineni
- Keyword Extraction From a Single Document Using Centrality Measures PREMI 2007Uploaded byGülhanEkindere
- sistema difusoUploaded byJuan Pablo Gomez Martinez
- Word Problem [MUST]Uploaded byshweta551
- net1.txtUploaded byVrunda
- CIP_Manufacturing_service_models_2014.pdfUploaded byManish Prasad
- Group decision making method based on single valued neutrosophic Choquet integral operatorUploaded byMia Amalia
- NP Completeness F07Uploaded bySabani
- DSP_ASSIGNMENT.pdfUploaded byParamesh Waran
- Programas de Matlab-Analisis Numérico II (2014-II).docxUploaded byLozano Ruiz Ivan
- JavaScriptUploaded byKittyR
- meniuUploaded byStroescu Marius Petrisor
- floorplanning.pptxUploaded byshabbir470
- Met a ProgrammingUploaded byMiguel Andre Espinola
- Module 3Uploaded byPRE-GAMERS INC.

- Tensor TransformationsUploaded byMark Lu
- cs2800 notes14Uploaded byMark Lu
- Homework 4Uploaded byMark Lu
- Homework 5Uploaded byMark Lu
- Homework 2Uploaded byMark Lu
- Homework 3Uploaded byMark Lu
- 28 Exam SolutionsUploaded byMark Lu
- Homework 1Uploaded byMark Lu
- 26 December 07Uploaded byMark Lu
- 27 December 09Uploaded byMark Lu
- 25 December 02Uploaded byMark Lu
- 24 November 30Uploaded byMark Lu
- 23 November 20Uploaded byMark Lu
- 22 November-16-18Uploaded byMark Lu
- 20 November 11Uploaded byMark Lu
- 21 November 13Uploaded byMark Lu
- 19 November 09Uploaded byMark Lu
- 18 November 06Uploaded byMark Lu
- 17 November 04Uploaded byMark Lu
- 16 November 02Uploaded byMark Lu
- 15 October 28Uploaded byMark Lu
- 14 October 23Uploaded byMark Lu
- 13 October 19Uploaded byMark Lu
- 12 October 16Uploaded byMark Lu
- 11 October 14Uploaded byMark Lu
- 10 October 09Uploaded byMark Lu
- 9 October 5Uploaded byMark Lu
- 8 October 2Uploaded byMark Lu
- 7 September 30Uploaded byMark Lu

- DivUploaded byDivyesh Nagarkar
- Scholarship Certificate Programs - CaliforniaUploaded byApple Tan
- presentationUploaded byMonica Jumani
- Bolt and Nut Lathe MachineUploaded byIxora My
- KIRBY Intercultural Competence CopiaUploaded byMARIA 2016
- Multi v Fallas_SpanishUploaded byEdward Toro
- d Itg ManualUploaded byJuank Andrade
- 194012 Desert Magazine 1940 DecemberUploaded bydm1937
- Oncor-Electric-Delivery-Company,-LLC-Oncor-Electric-Delivery-Tariff-BookUploaded byGenability
- 3364-7048-2-PBUploaded bythahira akmarida islamiah
- PQR 작성(영).pptUploaded byhunghoanglong
- People Soft FIN ESA Rel89 Bundle16 Release NotesUploaded byrajiv_xguys
- A Comparative Evaluation of Lingual Retainer Failure Bonded With or WithoutUploaded byMankirat Grewal
- Instrument Index ExampleUploaded bydevarshimishra
- A psychometric evaluation of the Highly Sensitive Person Scale: The components of sensory-processing sensitivity and their relation to the BIS/BAS and ‘‘Big Five’’Uploaded byLqaler
- Infection control bundles for hospitalUploaded byumeshbharti
- Am a Gram 56Uploaded bycgratna
- Economic Dimensions of EnvironmentUploaded byDHRUVSNEHAL
- thomas midgley, jr biography--by joseph e valenciaUploaded byapi-286963355
- Triage QualificationsUploaded byRangga BanGun
- Isoflex_Topas_L_32Uploaded byc108
- Customer Sample Report Bsr for s4hanaUploaded byNitin
- [Bookflare.net] - MS Excel Let's Advance to the Next LevelUploaded byComan Flavius-Alin
- 441 w Fault FindUploaded byabdussamih
- St. Lucia, Energy Report Card 2017, 12-2018Uploaded byDetlef Loy
- Gre Revised 19th Edition.pdfUploaded bybunty chhattani
- Bookkeepin Reviewer With AnswerUploaded byReigh Vest Toll
- ElectroplatingUploaded byvibhorsoni123
- mwhitedraftrhetoricalanalysis2Uploaded byapi-386065660
- Intech-An Advanced and Automated Neural Network Based Textile Defect DetectorUploaded byPrabhjatan Singh Padam

## Much more than documents.

Discover everything Scribd has to offer, including books and audiobooks from major publishers.

Cancel anytime.