Scribd
Upload
110 views

CS310 Automata Theory - 2016-2017: Nutan Limaye

This document outlines the syllabus for the CS310 Automata Theory course taught by Nutan Limaye at IIT Bombay in 2016-2017. The course covers topics like regular languages, finite automata, pushdown automata, Turing machines and computability. It also provides examples of using finite state automata to check various language properties. The grading scheme and course schedule are also mentioned.

Uploaded by

Kumar Ashutosh
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
110 views

CS310 Automata Theory - 2016-2017: Nutan Limaye

This document outlines the syllabus for the CS310 Automata Theory course taught by Nutan Limaye at IIT Bombay in 2016-2017. The course covers topics like regular languages, finite automata, pushdown automata, Turing machines and computability. It also provides examples of using finite state automata to check various language properties. The grading scheme and course schedule are also mentioned.

Uploaded by

Kumar Ashutosh
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

CS310 Automata Theory – 2016-2017

Nutan Limaye

Indian Institute of Technology, Bombay


[email protected]

Module 1: Finite state automata

Nutan (IITB) CS310 Automata Theory – 2016-2017 January 2017 1/1


Credit Structure
Course credit structure

quizzes 30%
mid-sem 30%
end-sem 40%

Office hours: 1 hour per week (Slot: TBA)


Problem solving session: 1 hour per week (Slot: TBA)

Nutan (IITB) CS310 Automata Theory – 2016-2017 January 2017 2/1


Course Outline
Regular languages, DFA/NFA, related topics.

Pushdown automata, context-free languages, other models of


computation.

Turing machines and computability.

Effective computation, NP vs. P, one-way functions.

Nutan (IITB) CS310 Automata Theory – 2016-2017 January 2017 3/1


Finite state automata
Example

Input: Text file over the alphabet {a, b}

Check: does the file end with the string ‘aa’

q0 a q1 a q2
start
b
a
b

Nutan (IITB) CS310 Automata Theory – 2016-2017 January 2017 4/1


Finite state automata
Example

Input: Text file over the alphabet {a, b}

Check: does the file contain the string ‘aa’

q0 a q1 a q2
start
b
a,b

Nutan (IITB) CS310 Automata Theory – 2016-2017 January 2017 5/1


Finite state automata
Example

Input: w ∈ {a, b}∗

Check: does w have odd number of as? i.e. is #a (w ) ≡ 1 (mod2)?

b b
a
start q0 q1
a

Nutan (IITB) CS310 Automata Theory – 2016-2017 January 2017 6/1


Finite state automata
Example

Input: w ∈ {0, 1}∗

Check: is the number represented by w in binary a multiple of 3?

q0 1 q1 0 q2
start
1 0
1

Nutan (IITB) CS310 Automata Theory – 2016-2017 January 2017 7/1


Definition of finite state automata
Definition (DFA)
A deterministic finite state automaton (DFA) A = (Q, Σ, q0 , F , δ), where
Q is a set of states,
Σ is the input alphabet,
q0 is the initial state,
F ⊆ Q is the set of final states,
δ is a set of transitions, i.e. δ ⊆ Q × Σ × Q such that
∀q ∈ Q, ∀a ∈ Σ, ∣δ(q, a)∣ ≤ 1.

Nutan (IITB) CS310 Automata Theory – 2016-2017 January 2017 8/1


Acceptance by DFA
Definition (Acceptance by DFA)
A deterministic finite state automaton (DFA) A = (Q, Σ, δ, q0 , F ), is said
to accept a word w ∈ Σ∗ , where w = w1 w2 . . . wn if
there exists a sequence of states p0 , p1 , . . . pn s.t.
p0 = q0 ,
pn ∈ F ,
δ(pi , wi+1 ) = pi+1 for all 0 ≤ i ≤ n.
δ is a set of transitions, i.e. δ ⊆ Q × Σ × Q such that
∀q ∈ Q, ∀a ∈ Σ, ∣δ(q, a)∣ ≤ 1.

Nutan (IITB) CS310 Automata Theory – 2016-2017 January 2017 9/1


Regular languages
Definition
A language L ⊆ Σ∗ is a said to be accepted by a DFA A if
L = {w ∣ w is accepted by A}.

Definition (REG)
A language is said to be a regular language if it is accepted by some DFA.

Examples
L = {w ∈ {a, b}∗ ∣ w ends with aa}
L′ = {w ∈ {a, b}∗ ∣ w contains aa}
Lodd = {w ∈ {a, b}∗ ∣ w contains odd number of a}
L3 = {w ∈ {0, 1}∗ ∣ w encodes a number in binary divisible by 3}

Nutan (IITB) CS310 Automata Theory – 2016-2017 January 2017 10 / 1

You might also like