Scribd
Upload
11 views14 pages

MIT18 404f20 Lec1

Uploaded by

hansikasiggar04
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
11 views14 pages

MIT18 404f20 Lec1

Uploaded by

hansikasiggar04
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 14

18.404/6.

840 Intro to the Theory of Computation

Instructor: Mike Sipser

TAs:
- Fadi Atieh, Damian Barabonkov,
- Alex Dimitrakakis, Thomas Xiong,
- Abbas Zeitoun, and Emily Liu

1
18.404 Course Outline

Computability Theory 1930s – 1950s


- What is computable… or not?
- Examples:
program verification, mathematical truth Complexity Theory 1960s – present
- Models of Computation: - What is computable in practice?
Finite automata, Turing machines, … - Example: factoring problem
- P versus NP problem
- Measures of complexity: Time and Space
- Models: Probabilistic and Interactive computation

2
Course Mechanics
Zoom Lectures
- Live and Interactive via Chat
- Live lectures are recorded for later viewing
Zoom Recitations
- Not recorded
- Two convert to in-person Homework bi-weekly – 35%
- Review concepts and more examples - More information to follow
- Optional unless you are having difficulty Midterm (15%) and Final exam (25%)
Participation can raise low grades
- Open book and notes
- Attend any recitation
Text Check-in quizzes for credit – 25%
- - Distinct Live and Recorded versions
Introduction to the Theory of Computation
Sipser, 3rd Edition US. (Other editions ok but - Complete either one for credit within 48 hours
are missing some Exercises and Problems). - Initially ungraded; full credit for participation
3
Course Expectations

Prerequisites
Prior substantial experience and comfort with
mathematical concepts, theorems, and proofs.
Creativity will be needed for psets and exams.

Collaboration policy on homework


- Allowed. But try problems yourself first.
- Write up your own solutions.
- No bibles or online materials.

4
Role of Theory in Computer Science

1. Applications
2. Basic Research
3. Connections to other fields
4. What is the nature of computation?

5
Let’s begin: Finite Automata
0
𝑀1 1
0,1
1
𝑞1 𝑞2 𝑞3
0

Input: finite string


States: Output: Accept or Reject

1 Computation process: Begin at start state,


Transitions: read input symbols, follow corresponding transitions,
Start state: Accept if end with accept state, Reject if not.
Examples: 01101 → Accept
Accept states: 00101 → Reject
accepts exactly those strings in where
contains substring

Say that is the language of and that recognizes and that .


6
Finite Automata – Formal Definition

Defn: A finite automaton is a 5-tuple


finite set of states
finite set of alphabet symbols
transition function Example:
a
start state
means 𝑞 𝑟 𝑀1 0
1
0,1
set of accept states 𝑞1 𝑞2 1
𝑞3
0

𝛿=¿ 0 1

7
Finite Automata – Computation

Strings and languages


- A string is a finite sequence of symbols in
- A language is a set of strings (finite or infinite)
- The empty string ε is the string of length 0
- The empty language is the set with no strings Recognizing languages
-
- is the language of
Defn: accepts string each - recognizes
if there is a sequence of states
where:
-
- for Defn: A language is regular if some
-
8
finite automaton recognizes it.
Regular Languages – Examples

𝑀1 0 1
0,1
1
𝑞1 𝑞2 𝑞3
0

More examples:

Let has an even number of 1s


Therefore is regular is regular (make automaton for practice).

Let has equal numbers of 0s and 1s


is not regular (we will prove).

Goal: Understand the regular languages


9
Regular Expressions
Regular operations. Let be languages:
- Union: or
- Concatenation: and
- Star: each for
Note: always Regular expressions
- Built from , members [Atomic]
- By using [Composite]
Example. Let good, bad and boy, girl.
- {good, bad, boy, girl} Examples:
- {goodboy, goodgirl, badboy, badgirl} - gives all strings over
- {, good, bad, goodgood, goodbad, badgood, - gives all strings that end with 1
badbad, goodgoodgood, goodgoodbad, … } - all strings that contain 11

Goal: Show finite automata equivalent to regular expressions


10
Closure Properties for Regular Languages
Theorem: If are regular languages, so is (closure under )
Proof: Let recognize
recognize
Construct recognizing
should accept input if either or accept .

𝑀 1Check-in 1.1 Components of :


𝑞 𝑀
In the proof, if and are finite automata and

?
where has states and has states
Then how many states does have? 𝑞,𝑟
𝑀 2 (a)
(b)
𝑟 NO! [gives intersectio
(c)
Check-in 1.1
11
Closure Properties continued
Theorem: If are regular languages, so is (closure under )
Proof: Let recognize
recognize
Construct recognizing

𝑀1 𝑀2

should accept input


if where
𝑀 accepts and accepts .

𝑤
𝑥 𝑦
Doesn’t work: Where to split ?
12
Quick review of today
1. Introduction, outline, mechanics,
expectations
2. Finite Automata, formal defi nition, regular
languages
3. Regular Operations and Regular
Expressions
4. Proved: Class of regular languages is
closed under
5. Started: Closure under , to be continued…

13
MIT OpenCourseWare
https://ocw.mit.edu

18.404J Theory of Computation


Fall 2020

For information about citing these materials or our Terms of Use, visit: https://ocw.mit.edu/terms.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy