22 views

Uploaded by GANAPATHY.S

THEROY

THEROY

Attribution Non-Commercial (BY-NC)

- The Social Contract Theory
- What is Social Contract Theory?
- Social Contract
- social contract theory
- Universal Declaration of Human Rights
- Price Elasticity of Demand
- Universal Declaration of Human Rights - Illustrated Version
- Article 3 of the Indian Constitution
- Karina Demand Theory and Elasticity Summary
- The UDHR and the Indian Constitution a Comparison
- Of The Social Contract.docx
- Social Contract Theory
- Social Contract Theory
- Family Law Project
- INTRODUCTION OF DEMAND THEORY
- The Social Contract of Men
- Indifference Curve Analysis
- "URGENT ACTIONS WITH RESPECT TO THE STATE BUDGET"
- Universal Declartation of Human Rights (Udhr)
- Universal Declaration of Human Rights

You are on page 1of 43

Web: http://www.ee.ntu.edu.tw/~yen

Time: 9:10-12:10 PM, Monday Place: BL 103 Office hours: by appointment Class web page:

http://www.ee.ntu.edu.tw/~yen/courses/TOC-2009.html

2

TEXTBOOK

Introduction to Automata Theory, Languages, and Computation 3rd Edition

John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman,

(Addison-Wesley, 2006)

3

2nd Edition

Introduction to Automata Theory, Languages, and Computation

John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman,

(2nd Ed. Addison-Wesley, 2001)

1st Edition

Introduction to Automata Theory, Languages, and Computation

John E. Hopcroft, Jeffrey D. Ullman,

(Addison-Wesley, 1979)

Grading

HW/Project : 20% Midterm exam.: 40%

Final exam.: 40%

A simple computer

BATTERY

input: switch

output: light bulb actions: flip switch

7

A simple computer

f

BATTERY

start

off

f

on

input: switch

output: light bulb actions: f for flip switch bulb is on if and only if there was an odd number of flips

8

Another computer 1

1 start off

1 2

1 2

off

BATTERY

2 2

off

on

actions: 1 for flip switch 1 actions: 2 for flip switch 2 bulb is on if and only if both switches were flipped an odd number of times

9

A design problem 4 1

BATTERY

2 3

Can you design a circuit where the light is on if and only if all the switches were flipped exactly the same number of times?

10

A design problem

Such devices are difficult to reason about, because they can be designed in an infinite number of ways By representing them as abstract computational devices, or automata, we will learn how to answer such questions

11

They can describe the operation of any small computer, like the control component of an alarm clock or a microwave They are also used in lexical analyzers to recognize well formed expressions in programming languages:

ab1 is a legal name of a variable in C 5u= is not

12

This was only one example of a computational device, and there are others We will look at different devices, and look at the following questions:

What can a given type of device compute, and what are its limitations? Is one type of device more powerful than another?

13

finite automata

push-down automata

Devices with infinite memory that can be accessed in a restricted way. Used to model parsers, etc.

Turing Machines Devices with infinite memory. Used to model any computer.

time-bounded Infinite memory, but bounded running Turing Machines time. Used to model any computer program that runs in a reasonable amount of 14 time.

Finite automata are a useful model for important kinds of hardware and software:

Software for designing and checking digital circuits. Lexical analyzer of compilers. Finding words and patterns in large bodies of text, e.g. in web pages. Verification of systems with finite number of states, e.g. communication protocols.

15

The study of Finite Automata and Formal Languages are intimately connected. Methods for specifying formal languages are very important in many areas of CS, e.g.:

Context Free Grammars are very useful when designing software that processes data with recursive structure, like the parser in a compiler. Regular Expressions are very useful for specifying lexical aspects of programming languages and search patterns.

16

Automata are essential for the study of the limits of computation. Two issues:

What can a computer do at all? (Decidability) What can a computer do efficiently? (Intractability)

17

...

Applications

Quantum computing

Supervisory control

Pattern recognition

circuits

Comm. protocols Prog. languages

Compiler

Computer-Aided Verification

18

To familiarize you with key Computer Science concepts in central areas like

- Automata Theory

To equip you with tools with wide applicability in the fields of CS and EE, e.g. for

- Complier Construction

19

Fundamental Theme

What are the capabilities and limitations of computers and computer programs?

What can we do with computers/programs? Are there things we cannot do with computers/programs?

20

How do we prove something CAN be done by SOME program?

How do we prove something CANNOT be done by ANY program?

21

Consider the following program. Does it terminate for all values of n 1? while (n > 1) { if even(n) { n = n / 2; } else { n = n * 3 + 1; } }

22

Not as easy to answer as it might first seem. Say we start with n = 7, for example: 7, 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1 In fact, for all numbers that have been tried (a lot!), it does terminate . . . . . . but in general?

23

Then the following important undecidability result should perhaps not come as a total surprise: It is impossible to write a program that decides if another, arbitrary, program terminates (halts) or not. What might be surprising is that it is possible to prove such a result. This was first done by the British mathematician Alan Turing.

24

Our focus

Computability

Automata

Complexity

25

Topics

1.

Finite automata, Regular languages, Regular grammars: deterministic vs. nondeterministic, one-way vs. two-way finite automata, minimization, pumping lemma for regular sets, closure properties.

Context-free grammars: deterministic vs. nondeterministic, one-way vs. two-way PDAs, reversal bounded PDAs, linear grammars, counter machines, pumping lemma for CFLs, Chomsky normal form, Greibach normal form, closure 26 properties.

Topics (contd)

3. Linear

4. Turing machines, Recursively enumerable sets, Type 0 grammars: variants of Turing machines, halting problem, undecidability, Post correspondence problem, valid and invalid computations of TMs.

27

Topics (contd)

5. Basic recursive function theory 6. Basic complexity theory: Various

resource bounded complexity classes, including NLOGSPACE, P, NP, PSPACE, EXPTIME, and many more. reducibility, completeness. 7. Advanced topics: Tree Automata, quantum automata, probabilistic automata, interactive proof systems, oracle computations, cryptography.

28

YOU

29

Languages

The terms language and word are used in a strict technical sense in this course: A language is a set of words. A word is a sequence (or string) of symbols. (or ) denotes the empty word, the sequence of zero symbols.

30

What is a symbol, then? Anything, but it has to come from an alphabet which is a finite set. A common (and important) instance is = {0, 1}. , the empty word, is never an symbol of an alphabet.

31

Computation

CPU

memory

32

CPU

output memory

Program memory

33

Example:

temporary memory

f ( x) x

input memory

CPU

Program memory compute compute output memory

xx

x x

2

34

f ( x) x

temporary memory

input memory

x2

CPU

Program memory compute compute output memory

xx

x x

2

35

temporary memory

z 2*2 4 f ( x) z * 2 8

f ( x) x

input memory

x2

CPU

Program memory compute compute output memory

xx

x x

2

36

temporary memory

z 2*2 4 f ( x) z * 2 8

f ( x) x

input memory

x2

CPU

Program memory compute compute

f ( x) 8

output memory

xx

x x

2

37

Automaton

temporary memory Automaton

input memory

CPU

output memory

Program memory

38

Automata are distinguished by the temporary memory Finite Automata: Pushdown Automata: Turing Machines: no temporary memory stack random access memory

39

Finite Automaton

temporary memory

Finite Automaton

40

Pushdown Automaton

Stack Push, Pop

Pushdown Automaton

41

Turing Machine

Random Access Memory

Turing Machine

42

Power of Automata

Finite Automata

Pushdown Automata

Turing Machine

Less power

43

- The Social Contract TheoryUploaded bybrockz26
- What is Social Contract Theory?Uploaded byRod Lagahit
- Social ContractUploaded byWasan Abod
- social contract theoryUploaded byAabha
- Universal Declaration of Human RightsUploaded byJanine Regalado
- Price Elasticity of DemandUploaded byAzizul Kirosaki
- Universal Declaration of Human Rights - Illustrated VersionUploaded byByron Pojol
- Article 3 of the Indian ConstitutionUploaded byParul Prasad
- Karina Demand Theory and Elasticity SummaryUploaded byKarina Permata Sari
- The UDHR and the Indian Constitution a ComparisonUploaded byAnkita Milan Negi
- Of The Social Contract.docxUploaded byChristine Pedery
- Social Contract TheoryUploaded byYasirAhmad
- Social Contract TheoryUploaded byEli Cohen
- Family Law ProjectUploaded byApoorvnujs
- INTRODUCTION OF DEMAND THEORYUploaded bynick_sya
- The Social Contract of MenUploaded byRichard Taegtmeier
- Indifference Curve AnalysisUploaded byZaheer Aslam
- "URGENT ACTIONS WITH RESPECT TO THE STATE BUDGET"Uploaded byErin Griffith
- Universal Declartation of Human Rights (Udhr)Uploaded byJeffy Emano
- Universal Declaration of Human RightsUploaded byJoramDavid
- Family Law ProjectUploaded byumang0987
- Universal Declaration of Human RightsUploaded byrecycled minds
- Indifference Curve AnalysisUploaded byanujjalans
- Demand theory.docxUploaded byAnonymous OEvDqC5e
- UDHRUploaded byantongrace22
- Types of DemandUploaded bysamueljamespeter
- Family Law Project TopicsUploaded byabeohar97
- Demand TheoryUploaded byIbrahim Abu

- Banking Services OperationsUploaded byGuruKPO
- 11th Accountancy First Revision Test 2019 Question Paper English MediumUploaded byGANAPATHY.S
- Victory Tuition CentreUploaded byGANAPATHY.S
- one marks 12 stdUploaded byGANAPATHY.S
- Enrollment GuideUploaded byGANAPATHY.S
- AUC_2013Uploaded bySampathkumar Mtech
- User ManualUploaded bySunny Chawla
- Namma Kalvi 11th Accountancy Government Model Question Paper Answer Key EmUploaded byGANAPATHY.S
- Leave Your Foot Ware HereUploaded byGANAPATHY.S
- VICTORY TUITION CENTRE (2).docxUploaded byGANAPATHY.S
- vtc ad.docxUploaded byGANAPATHY.S
- Global Kids BrochureUploaded byGANAPATHY.S
- Admission Form Play schoolUploaded byGANAPATHY.S
- Admission FormUploaded byGANAPATHY.S
- 11th Commerce 3 Marks Study Material English MediumUploaded byGANAPATHY.S
- 11th Economics 1235 Marks Study Material English Medium (1)Uploaded byGANAPATHY.S
- amndbcom08_09Uploaded byGANAPATHY.S
- 280816Uploaded byGANAPATHY.S
- ResumeUploaded byGANAPATHY.S
- Regular Exam UG & PG TT (1)Uploaded byGANAPATHY.S
- Front SheetsUploaded byGANAPATHY.S
- Banarasi Saree KkUploaded byGANAPATHY.S
- Favorite BookUploaded byGANAPATHY.S
- 10 Steps to Conflict ResolutionUploaded byGANAPATHY.S
- My Uploaded CvUploaded byGANAPATHY.S
- HDFC LetterUploaded byGANAPATHY.S
- Cs2357 Ooad Lab ManualUploaded byabinayamalathy
- Front PageUploaded byGANAPATHY.S
- Book1Uploaded byGANAPATHY.S

- Theory of ComputationUploaded byShanmugasundaram Muthuswamy
- 4.pushdownautomataunit-4.pdfUploaded byAshishKumar
- autoprob3Uploaded byAnuja Tandale
- FAFL Notes [2010] (SJBIT)Uploaded bymaruthinmdc
- lec3Uploaded bykuku288
- Chapter 6Uploaded byTaqi Shah
- Theory of Computation MCQsUploaded byJitender Sharma
- Final Version_TE_IT_Syllabus_2015_Course.pdfUploaded byanbhute3484
- all mcqUploaded byTHANGAMARI
- Thoc Full Slide CopyUploaded bySwapnil Bishnu
- A Gladij - Theory of Formal GrammarsUploaded byAlgoritzmi
- 6th semUploaded byapi-3718533
- TOC_Questions_012210030237_1Uploaded byPrabhu Dhandapani
- TE Session PlanUploaded byanon_747680669
- 3 - 4 - 12. Pushdown Automata (24 Min.)Uploaded byHuong Luong
- Wilhelm, Seidl, Hack - Compiler Design. Syntactic and Semantic AnalysisUploaded byCatalin Olteanu
- Push Down Automata NewUploaded byChaitanya Hebbal
- 2-stack-PDA-2ndUploaded byShivendra Agarwal
- Push Down AutomataUploaded byRiya Sapra
- Week_1Uploaded byWareesha Lashari
- Cs2303 Theory of Computation 2marksUploaded byShanmugasundaram Muthuswamy
- Chapter 06. Other Automata ModelsUploaded bykims3515354178
- Lecture 5Uploaded byFrozenSoul
- FLC - 3 September 2014 - With SolutionsUploaded byJacopo Fiorenza
- Final CSE v Semester New SyllabusUploaded bysaurabh303
- Theory of Computation.pdfUploaded byPRINCE DEWANGAN
- Models for Computation: Part IIIUploaded bySam Myo Kim
- Langsec TrUploaded byarismiots
- Recursive Automata 2Uploaded bybbscribed
- PDA to CFGUploaded byRajendranbehappy