Introduction to the Theory of Computation. Automata 1VO + 1PS. Lecturer: Dr. Ana Sokolova.
|
|
- Oscar Shields
- 6 years ago
- Views:
Transcription
1 Introduction to the Theory of Computation Automata 1VO + 1PS Lecturer: Dr. Ana Sokolova
2 Setup and Dates Lectures and Instructions Books Introduction to the Theory of Computation by M. Sipser Introduction to Automata Theory, Languages, and Computation by J. E. Hopcroft, R. Motwani, and J.D. Ullman
3 Setup and Dates Lectures and Instructions Books automata Introduction to the Theory of Computation by M. Sipser Introduction to Automata Theory, Languages, and Computation by J. E. Hopcroft, R. Motwani, and J.D. Ullman
4 Setup and Dates Lectures and Instructions Books automata grammars Introduction to the Theory of Computation by M. Sipser Introduction to Automata Theory, Languages, and Computation by J. E. Hopcroft, R. Motwani, and J.D. Ullman
5 Setup and Dates Lectures and Instructions Books automata grammars pushdown automata Introduction to the Theory of Computation by M. Sipser Introduction to Automata Theory, Languages, and Computation by J. E. Hopcroft, R. Motwani, and J.D. Ullman
6 Setup and Dates Lectures and Instructions Books automata grammars pushdown automata Turing machines Introduction to the Theory of Computation by M. Sipser Introduction to Automata Theory, Languages, and Computation by J. E. Hopcroft, R. Motwani, and J.D. Ullman
7 Setup and Dates Lectures and Instructions Books automata grammars pushdown automata Turing machines Introduction to the Theory of Computation by M. Sipser Introduction to Automata Theory, Languages, and Computation by J. E. Hopcroft, R. Motwani, and J.D. Ullman computability
8 The Rules... Instructions Starting in 2 weeks Instruction exercises on the web Automata2015.html after class To be solved by you, the students, (in groups of at most 3 people) and handed in as homework at the next meeting. In class I will present a sample solution and you, the students, will be asked to present solutions/discuss the exercises
9 The Rules... Instructions One randomly chosen exercise will be graded each week The graded exercise will be returned at the next meeting. Grade based on (1) exam (2) the grades of the corrected exercise and (3) activity in class (ability to present solutions) All information about the course / rules / exams / grading is / will be on the course webpage
10 The Rules... Grading Written exam on December 18, 10 am - 12:30 pm Grade based on the number of points on the written exam (80%), homework grades, and activity in class (20%) For better grade oral exam after the written one upon appointment 55% of the maximal points are needed to pass.
11 Finite Automata
12 Alphabets and Languages Alphabet and words if y is not free in P and Q
13 Alphabets and Languages - alphabet (finite set) n = {a1a2..an ai } is the set of words of length n * = {w n N. a1, a2,.., an. w = a1a2..an} is the set of all words over Alphabet and words if y is not free in P and Q
14 Alphabets and Languages 0 = {ℇ} contains only the empty word - alphabet (finite set) n = {a1a2..an ai } is the set of words of length n * = {w n N. a1, a2,.., an. w = a1a2..an} is the set of all words over Alphabet and words if y is not free in P and Q
15 Alphabets and Languages 0 = {ℇ} contains only the empty word - alphabet (finite set) n = {a1a2..an ai } is the set of words of length n * = {w n N. a1, a2,.., an. w = a1a2..an} is the set of all words over Alphabet and words A language L over is a subset L * if y is not free in P and Q
16 Deterministic Automata (DFA) Informal example = {0,1} M1: q0 q1 1 if y is not free in P and Q
17 Deterministic Automata (DFA) alphabet Informal example = {0,1} M1: q0 q1 1 if y is not free in P and Q
18 Deterministic Automata (DFA) alphabet Informal example = {0,1} M1: q0, q1 are states q0 q1 1 if y is not free in P and Q
19 Deterministic Automata (DFA) alphabet Informal example = {0,1} M1: q0, q1 are states q0 q1 q0 is initial 1 if y is not free in P and Q
20 Deterministic Automata (DFA) alphabet Informal example = {0,1} M1: q0, q1 are states q0 q1 q0 is initial 1 q1 is final if y is not free in P and Q
21 Deterministic Automata (DFA) alphabet Informal example = {0,1} M1: q0, q1 are states q0 is initial q0 1 q1 q1 is final if y is not free in P and Q transitions, labelled by alphabet symbols
22 Deterministic Automata (DFA) alphabet Informal example = {0,1} M1: q0, q1 are states q0 is initial q0 1 q1 q1 is final if y is not free in P and Q transitions, labelled by alphabet symbols Accepts the language L(M1) = {w * w ends with a 0} = * 0
23 Deterministic Automata (DFA) alphabet Informal example = {0,1} M1: q0, q1 are states q0 is initial q0 1 q1 q1 is final if y is not free in P and Q transitions, labelled by alphabet symbols Accepts the language L(M1) = {w * w ends with a 0} = * 0 regular language
24 Deterministic Automata (DFA) alphabet Informal example = {0,1} M1: q0, q1 are states q0 is initial q0 1 q1 q1 is final if y is not free in P and Q transitions, labelled by alphabet symbols Accepts the language L(M1) = {w * w ends with a 0} = * 0 regular language regular expression
25 DFA Definition A deterministic finite automaton M is a tuple M = (Q,, δ, q0, F) where Q is a finite set of states is a finite alphabet δ: Q x Q is the transition function q0 is the initial state, q0 Q if y is not free in P and Q F is a set of final states, F Q
26 DFA Definition A deterministic finite automaton M is a tuple M = (Q,, δ, q0, F) where Q is a finite set of states is a finite alphabet δ: Q x Q is the transition function q0 is the initial state, q0 Q if y is not free in P and Q F is a set of final states, F Q In the example M
27 DFA Definition A deterministic finite automaton M is a tuple M = (Q,, δ, q0, F) where Q is a finite set of states is a finite alphabet δ: Q x Q is the transition function q0 is the initial state, q0 Q if y is not free in P and Q F is a set of final states, F Q In the example M M1 = (Q,, δ, q0, F) for
28 DFA Definition A deterministic finite automaton M is a tuple M = (Q,, δ, q0, F) where Q is a finite set of states is a finite alphabet δ: Q x Q is the transition function q0 is the initial state, q0 Q if y is not free in P and Q F is a set of final states, F Q In the example M M1 = (Q,, δ, q0, F) for Q = {q0, q1}
29 DFA Definition A deterministic finite automaton M is a tuple M = (Q,, δ, q0, F) where Q is a finite set of states is a finite alphabet δ: Q x Q is the transition function q0 is the initial state, q0 Q if y is not free in P and Q F is a set of final states, F Q In the example M M1 = (Q,, δ, q0, F) for Q = {q0, q1} = {0, 1}
30 DFA Definition A deterministic finite automaton M is a tuple M = (Q,, δ, q0, F) where Q is a finite set of states is a finite alphabet δ: Q x Q is the transition function q0 is the initial state, q0 Q if y is not free in P and Q F is a set of final states, F Q In the example M M1 = (Q,, δ, q0, F) for Q = {q0, q1} = {0, 1} F = {q1}
31 DFA Definition A deterministic finite automaton M is a tuple M = (Q,, δ, q0, F) where Q is a finite set of states is a finite alphabet δ: Q x Q is the transition function q0 is the initial state, q0 Q if y is not free in P and Q F is a set of final states, F Q In the example M M1 = (Q,, δ, q0, F) for Q = {q0, q1} = {0, 1} F = {q1} δ(q0, 0) = q1,δ(q0, 1) = q0 δ(q1, 0) = q1, δ(q1, 1) = q0
32 DFA The extended transition function if y is not free in P and Q
33 DFA The extended transition function Given M = (Q,, δ, q0, F) we can extend δ: Q x Q to δ * : Q x * Q inductively, by: δ * (q, ε) = q and δ * (q,wa) = δ(δ * (q,w), a) if y is not free in P and Q
34 DFA The extended transition function Given M = (Q,, δ, q0, F) we can extend δ: Q x Q to δ * : Q x * Q In M1, δ * (q0,110010) = q1 inductively, by: if y is not free in P and Q δ * (q, ε) = q and δ * (q,wa) = δ(δ * (q,w), a)
35 DFA The extended transition function Given M = (Q,, δ, q0, F) we can extend δ: Q x Q to δ * : Q x * Q In M1, δ * (q0,110010) = q1 inductively, by: if y is not free in P and Q δ * (q, ε) = q and δ * (q,wa) = δ(δ * (q,w), a) Definition The language recognised / accepted by a deterministic finite automaton M = (Q,, δ, q0, F) is L(M) = {w * δ * (q0,w) F}
36 DFA The extended transition function Given M = (Q,, δ, q0, F) we can extend δ: Q x Q to δ * : Q x * Q In M1, δ * (q0,110010) = q1 inductively, by: if y is not free in P and Q δ * (q, ε) = q and δ * (q,wa) = δ(δ * (q,w), a) Definition The language recognised / accepted by a deterministic finite automaton M = (Q,, δ, q0, F) is L(M) = {w * δ * (q0,w) F} L(M1) = {w0 w {0,1} * }
37 Regular languages and operations Definition Let be an alphabet. A language L over (L * ) is regular iff it is recognised by a DFA.
38 Definition Regular languages and operations Let be an alphabet. A language L over (L * ) is regular iff it is recognised by a DFA. L(M1) = {w0 w {0,1} * } is regular
39 Definition Regular languages and operations Let be an alphabet. A language L over (L * ) is regular iff it is recognised by a DFA. L(M1) = {w0 w {0,1} * } is regular Regular operations
40 Definition Regular languages and operations Let be an alphabet. A language L over (L * ) is regular iff it is recognised by a DFA. L(M1) = {w0 w {0,1} * } is regular Regular operations Let L, L1, L2 be languages over. Then L1 L2, L1 L2, and L * are languages, where L1 L2 = {w1 w2 w1 L1,w2 L2} L * = {w n N. w1, w2,.., wn L. w = w1w2..wn}
41 Definition Regular languages and operations Let be an alphabet. A language L over (L * ) is regular iff it is recognised by a DFA. L(M1) = {w0 w {0,1} * } is regular Regular operations Let L, L1, L2 be languages over. Then L1 L2, L1 L2, and L * are languages, where L1 L2 = {w1 w2 w1 L1,w2 L2} L * = {w n N. w1, w2,.., wn L. w = w1w2..wn} ℇ L * always
42 Definition Regular expressions
43 finite representation of infinite languages Regular expressions Definition
44 finite representation of infinite languages Regular expressions Definition Let be an alphabet. The following are regular expressions 1. a for a 2. ε (R1 R2) for R1, R2 regular expressions 5. (R1 R2) for R1, R2 regular expressions 6. (R1) * for R1 regular expression
45 Regular expressions inductive finite representation of infinite languages Definition Let be an alphabet. The following are regular expressions 1. a for a 2. ε (R1 R2) for R1, R2 regular expressions 5. (R1 R2) for R1, R2 regular expressions 6. (R1) * for R1 regular expression
46 finite representation of infinite languages Regular expressions Definition inductive example: (ab a) * Let be an alphabet. The following are regular expressions 1. a for a 2. ε (R1 R2) for R1, R2 regular expressions 5. (R1 R2) for R1, R2 regular expressions 6. (R1) * for R1 regular expression
47 finite representation of infinite languages Regular expressions Definition inductive example: (ab a) * Let be an alphabet. The following are regular expressions 1. a for a corresponding languages L(a) = {a} 2. ε L(ε) = {ε} 3. L( ) = 4. (R1 R2) for R1, R2 regular expressions L(R1 R2) = L(R1) L(R2) 5. (R1 R2) for R1, R2 regular expressions L(R1 R2) = L(R1) L(R2) 6. (R1) * for R1 regular expression L(R1 * ) = L(R1) *
48 Equivalence of regular expressions and regular languages if y is not free in P and Q
49 Equivalence of regular expressions and regular languages Theorem (Kleene) A language is regular (i.e., recognised by a finite automaton) iff it is the language of a regular expression. if y is not free in P and Q
50 Equivalence of regular expressions and regular languages Theorem (Kleene) A language is regular (i.e., recognised by a finite automaton) iff it is the language of a regular expression. Proof easy, via the closure if y is not free in P and Q properties discussed next, not so easy, we ll skip it for now
51 Closure under regular operations
52 Closure under regular operations Theorem C1 The class of regular languages is closed under union
53 Closure under regular operations also under intersection Theorem C1 The class of regular languages is closed under union
54 Closure under regular operations also under intersection Theorem C1 The class of regular languages is closed under union Theorem C2 The class of regular languages is closed under complement
55 Closure under regular operations also under intersection Theorem C1 The class of regular languages is closed under union Theorem C2 The class of regular languages is closed under complement Theorem C3 The class of regular languages is closed under concatenation
56 Closure under regular operations also under intersection Theorem C1 The class of regular languages is closed under union Theorem C2 The class of regular languages is closed under complement Theorem C3 The class of regular languages is closed under concatenation Theorem C4 The class of regular languages is closed under Kleene star
57 Closure under regular operations also under intersection Theorem C1 The class of regular languages is closed under union We can already prove these Theorem C2 The class of regular languages is closed under complement Theorem C3 The class of regular languages is closed under concatenation Theorem C4 The class of regular languages is closed under Kleene star
58 Closure under regular operations also under intersection Theorem C1 The class of regular languages is closed under union We can already prove these Theorem C2 The class of regular languages is closed under complement Theorem C3 The class of regular languages is closed under concatenation But not yet these two Theorem C4 The class of regular languages is closed under Kleene star
59 Nondeterministic Automata (NFA) Informal example = {0,1} M2: 0,1 q0 1 q1 0,ε q2 1 q3 0,1
60 Nondeterministic Automata (NFA) Informal example = {0,1} M2: 0,1 q0 1 q1 0,ε q2 1 q3 0,1 sources of nondeterminism
61 Nondeterministic Automata (NFA) Informal example = {0,1} M2: 0,1 q0 1 q1 0,ε q2 1 q3 0,1 sources of nondeterminism
62 Nondeterministic Automata (NFA) Informal example = {0,1} M2: 0,1 q0 1 q1 0,ε q2 1 q3 0,1 sources of nondeterminism
63 Nondeterministic Automata (NFA) no 1 transition Informal example = {0,1} M2: 0,1 q0 1 q1 0,ε q2 1 q3 0,1 sources of nondeterminism
64 Nondeterministic Automata (NFA) no 1 transition Informal example no 0 transition = {0,1} M2: 0,1 q0 1 q1 0,ε q2 1 q3 0,1 sources of nondeterminism
65 Nondeterministic Automata (NFA) no 1 transition Informal example no 0 transition = {0,1} M2: 0,1 q0 1 q1 0,ε q2 1 q3 0,1 sources of nondeterminism Accepts a word iff there exists an accepting run
66 NFA Definition A nondeterministic automaton M is a tuple M = (Q,, δ, q0, F) where Q is a finite set of states is a finite alphabet δ: Q x ε P(Q) is the transition function q0 is the initial state, q0 Q F is a set of final states, F Q if y is not free in P and Q
67 NFA Definition A nondeterministic automaton M is a tuple M = (Q,, δ, q0, F) where Q is a finite set of states is a finite alphabet ε = {ε} δ: Q x ε P(Q) is the transition function q0 is the initial state, q0 Q if y is not free in P and Q F is a set of final states, F Q
68 NFA Definition A nondeterministic automaton M is a tuple M = (Q,, δ, q0, F) where Q is a finite set of states is a finite alphabet ε = {ε} δ: Q x ε P(Q) is the transition function q0 is the initial state, q0 Q if y is not free in P and Q F is a set of final states, F Q In the example M
69 NFA Definition A nondeterministic automaton M is a tuple M = (Q,, δ, q0, F) where Q is a finite set of states is a finite alphabet ε = {ε} δ: Q x ε P(Q) is the transition function q0 is the initial state, q0 Q if y is not free in P and Q F is a set of final states, F Q In the example M M2 = (Q,, δ, q0, F) for
70 NFA Definition A nondeterministic automaton M is a tuple M = (Q,, δ, q0, F) where Q is a finite set of states is a finite alphabet ε = {ε} δ: Q x ε P(Q) is the transition function q0 is the initial state, q0 Q if y is not free in P and Q F is a set of final states, F Q In the example M M2 = (Q,, δ, q0, F) for Q = {q0, q1, q2, q3}
71 NFA Definition A nondeterministic automaton M is a tuple M = (Q,, δ, q0, F) where Q is a finite set of states is a finite alphabet ε = {ε} δ: Q x ε P(Q) is the transition function q0 is the initial state, q0 Q if y is not free in P and Q F is a set of final states, F Q In the example M M2 = (Q,, δ, q0, F) for Q = {q0, q1, q2, q3} = {0, 1}
72 NFA Definition A nondeterministic automaton M is a tuple M = (Q,, δ, q0, F) where Q is a finite set of states is a finite alphabet ε = {ε} δ: Q x ε P(Q) is the transition function q0 is the initial state, q0 Q if y is not free in P and Q F is a set of final states, F Q In the example M M2 = (Q,, δ, q0, F) for Q = {q0, q1, q2, q3} = {0, 1} F = {q3}
73 NFA Definition A nondeterministic automaton M is a tuple M = (Q,, δ, q0, F) where Q is a finite set of states is a finite alphabet ε = {ε} δ: Q x ε P(Q) is the transition function q0 is the initial state, q0 Q if y is not free in P and Q F is a set of final states, F Q In the example M Q = {q0, q1, q2, q3} = {0, 1} F = {q3} M2 = (Q,, δ, q0, F) for δ(q0, 0) = {q0} δ(q0, 1) = {q0,q1} δ(q0, ε) =..
Introduction to the Theory of Computation. Automata 1VO + 1PS. Lecturer: Dr. Ana Sokolova.
Introduction to the Theory of Computation Automata 1VO + 1PS Lecturer: Dr. Ana Sokolova http://cs.uni-salzburg.at/~anas/ Setup and Dates Lectures Tuesday 10:45 pm - 12:15 pm Instructions Tuesday 12:30
More informationCS 154, Lecture 2: Finite Automata, Closure Properties Nondeterminism,
CS 54, Lecture 2: Finite Automata, Closure Properties Nondeterminism, Why so Many Models? Streaming Algorithms 0 42 Deterministic Finite Automata Anatomy of Deterministic Finite Automata transition: for
More informationTheory of Computation (I) Yijia Chen Fudan University
Theory of Computation (I) Yijia Chen Fudan University Instructor Yijia Chen Homepage: http://basics.sjtu.edu.cn/~chen Email: yijiachen@fudan.edu.cn Textbook Introduction to the Theory of Computation Michael
More informationFORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY
5-453 FORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY NON-DETERMINISM and REGULAR OPERATIONS THURSDAY JAN 6 UNION THEOREM The union of two regular languages is also a regular language Regular Languages Are
More informationCOM364 Automata Theory Lecture Note 2 - Nondeterminism
COM364 Automata Theory Lecture Note 2 - Nondeterminism Kurtuluş Küllü March 2018 The FA we saw until now were deterministic FA (DFA) in the sense that for each state and input symbol there was exactly
More informationAutomata and Languages
Automata and Languages Prof. Mohamed Hamada Software Engineering Lab. The University of Aizu Japan Nondeterministic Finite Automata with empty moves (-NFA) Definition A nondeterministic finite automaton
More informationCS 455/555: Finite automata
CS 455/555: Finite automata Stefan D. Bruda Winter 2019 AUTOMATA (FINITE OR NOT) Generally any automaton Has a finite-state control Scans the input one symbol at a time Takes an action based on the currently
More informationTheory of Computation Lecture 1. Dr. Nahla Belal
Theory of Computation Lecture 1 Dr. Nahla Belal Book The primary textbook is: Introduction to the Theory of Computation by Michael Sipser. Grading 10%: Weekly Homework. 30%: Two quizzes and one exam. 20%:
More informationCS 154. Finite Automata, Nondeterminism, Regular Expressions
CS 54 Finite Automata, Nondeterminism, Regular Expressions Read string left to right The DFA accepts a string if the process ends in a double circle A DFA is a 5-tuple M = (Q, Σ, δ, q, F) Q is the set
More informationNondeterministic Finite Automata
Nondeterministic Finite Automata Not A DFA Does not have exactly one transition from every state on every symbol: Two transitions from q 0 on a No transition from q 1 (on either a or b) Though not a DFA,
More informationEquivalence of DFAs and NFAs
CS 172: Computability and Complexity Equivalence of DFAs and NFAs It s a tie! DFA NFA Sanjit A. Seshia EECS, UC Berkeley Acknowledgments: L.von Ahn, L. Blum, M. Blum What we ll do today Prove that DFAs
More informationTheory of Computation
Theory of Computation COMP363/COMP6363 Prerequisites: COMP4 and COMP 6 (Foundations of Computing) Textbook: Introduction to Automata Theory, Languages and Computation John E. Hopcroft, Rajeev Motwani,
More information3515ICT: Theory of Computation. Regular languages
3515ICT: Theory of Computation Regular languages Notation and concepts concerning alphabets, strings and languages, and identification of languages with problems (H, 1.5). Regular expressions (H, 3.1,
More informationAutomata and Formal Languages - CM0081 Non-Deterministic Finite Automata
Automata and Formal Languages - CM81 Non-Deterministic Finite Automata Andrés Sicard-Ramírez Universidad EAFIT Semester 217-2 Non-Deterministic Finite Automata (NFA) Introduction q i a a q j a q k The
More informationLecture 3: Nondeterministic Finite Automata
Lecture 3: Nondeterministic Finite Automata September 5, 206 CS 00 Theory of Computation As a recap of last lecture, recall that a deterministic finite automaton (DFA) consists of (Q, Σ, δ, q 0, F ) where
More informationT (s, xa) = T (T (s, x), a). The language recognized by M, denoted L(M), is the set of strings accepted by M. That is,
Recall A deterministic finite automaton is a five-tuple where S is a finite set of states, M = (S, Σ, T, s 0, F ) Σ is an alphabet the input alphabet, T : S Σ S is the transition function, s 0 S is the
More informationFinite Automata and Regular languages
Finite Automata and Regular languages Huan Long Shanghai Jiao Tong University Acknowledgements Part of the slides comes from a similar course in Fudan University given by Prof. Yijia Chen. http://basics.sjtu.edu.cn/
More informationInf2A: Converting from NFAs to DFAs and Closure Properties
1/43 Inf2A: Converting from NFAs to DFAs and Stuart Anderson School of Informatics University of Edinburgh October 13, 2009 Starter Questions 2/43 1 Can you devise a way of testing for any FSM M whether
More informationFormal Models in NLP
Formal Models in NLP Finite-State Automata Nina Seemann Universität Stuttgart Institut für Maschinelle Sprachverarbeitung Pfaffenwaldring 5b 70569 Stuttgart May 15, 2012 Nina Seemann (IMS) Formal Models
More informationINF Introduction and Regular Languages. Daniel Lupp. 18th January University of Oslo. Department of Informatics. Universitetet i Oslo
INF28 1. Introduction and Regular Languages Daniel Lupp Universitetet i Oslo 18th January 218 Department of Informatics University of Oslo INF28 Lecture :: 18th January 1 / 33 Details on the Course consists
More informationCS 154 Introduction to Automata and Complexity Theory
CS 154 Introduction to Automata and Complexity Theory cs154.stanford.edu 1 INSTRUCTORS & TAs Ryan Williams Cody Murray Lera Nikolaenko Sunny Rajan 2 Textbook 3 Homework / Problem Sets Homework will be
More informationAutomata Theory. Lecture on Discussion Course of CS120. Runzhe SJTU ACM CLASS
Automata Theory Lecture on Discussion Course of CS2 This Lecture is about Mathematical Models of Computation. Why Should I Care? - Ways of thinking. - Theory can drive practice. - Don t be an Instrumentalist.
More informationUNIT-II. NONDETERMINISTIC FINITE AUTOMATA WITH ε TRANSITIONS: SIGNIFICANCE. Use of ε-transitions. s t a r t. ε r. e g u l a r
Syllabus R9 Regulation UNIT-II NONDETERMINISTIC FINITE AUTOMATA WITH ε TRANSITIONS: In the automata theory, a nondeterministic finite automaton (NFA) or nondeterministic finite state machine is a finite
More informationChapter Five: Nondeterministic Finite Automata
Chapter Five: Nondeterministic Finite Automata From DFA to NFA A DFA has exactly one transition from every state on every symbol in the alphabet. By relaxing this requirement we get a related but more
More informationCS 154, Lecture 3: DFA NFA, Regular Expressions
CS 154, Lecture 3: DFA NFA, Regular Expressions Homework 1 is coming out Deterministic Finite Automata Computation with finite memory Non-Deterministic Finite Automata Computation with finite memory and
More informationIntro to Theory of Computation
Intro to Theory of Computation 1/19/2016 LECTURE 3 Last time: DFAs and NFAs Operations on languages Today: Nondeterminism Equivalence of NFAs and DFAs Closure properties of regular languages Sofya Raskhodnikova
More informationNondeterministic Finite Automata
Nondeterministic Finite Automata Lecture 6 Section 2.2 Robb T. Koether Hampden-Sydney College Mon, Sep 5, 2016 Robb T. Koether (Hampden-Sydney College) Nondeterministic Finite Automata Mon, Sep 5, 2016
More informationNon-deterministic Finite Automata (NFAs)
Algorithms & Models of Computation CS/ECE 374, Fall 27 Non-deterministic Finite Automata (NFAs) Part I NFA Introduction Lecture 4 Thursday, September 7, 27 Sariel Har-Peled (UIUC) CS374 Fall 27 / 39 Sariel
More informationComputational Models Lecture 2 1
Computational Models Lecture 2 1 Handout Mode Iftach Haitner. Tel Aviv University. October 30, 2017 1 Based on frames by Benny Chor, Tel Aviv University, modifying frames by Maurice Herlihy, Brown University.
More informationSri vidya college of engineering and technology
Unit I FINITE AUTOMATA 1. Define hypothesis. The formal proof can be using deductive proof and inductive proof. The deductive proof consists of sequence of statements given with logical reasoning in order
More informationLecture 4 Nondeterministic Finite Accepters
Lecture 4 Nondeterministic Finite Accepters COT 4420 Theory of Computation Section 2.2, 2.3 Nondeterminism A nondeterministic finite automaton can go to several states at once. Transitions from one state
More informationClosure Properties of Regular Languages. Union, Intersection, Difference, Concatenation, Kleene Closure, Reversal, Homomorphism, Inverse Homomorphism
Closure Properties of Regular Languages Union, Intersection, Difference, Concatenation, Kleene Closure, Reversal, Homomorphism, Inverse Homomorphism Closure Properties Recall a closure property is a statement
More informationCSE 105 THEORY OF COMPUTATION
CSE 105 THEORY OF COMPUTATION Spring 2016 http://cseweb.ucsd.edu/classes/sp16/cse105-ab/ Today's learning goals Sipser Ch 3.3, 4.1 State and use the Church-Turing thesis. Give examples of decidable problems.
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 informationCSE 105 Theory of Computation Professor Jeanne Ferrante
CSE 105 Theory of Computation http://www.jflap.org/jflaptmp/ Professor Jeanne Ferrante 1 Today s agenda NFA Review and Design NFA s Equivalence to DFA s Another Closure Property proof for Regular Languages
More informationPeter Wood. Department of Computer Science and Information Systems Birkbeck, University of London Automata and Formal Languages
and and Department of Computer Science and Information Systems Birkbeck, University of London ptw@dcs.bbk.ac.uk Outline and Doing and analysing problems/languages computability/solvability/decidability
More informationDeterministic Finite Automata. Non deterministic finite automata. Non-Deterministic Finite Automata (NFA) Non-Deterministic Finite Automata (NFA)
Deterministic Finite Automata Non deterministic finite automata Automata we ve been dealing with have been deterministic For every state and every alphabet symbol there is exactly one move that the machine
More informationRegular Expressions. Definitions Equivalence to Finite Automata
Regular Expressions Definitions Equivalence to Finite Automata 1 RE s: Introduction Regular expressions are an algebraic way to describe languages. They describe exactly the regular languages. If E is
More informationClosure under the Regular Operations
September 7, 2013 Application of NFA Now we use the NFA to show that collection of regular languages is closed under regular operations union, concatenation, and star Earlier we have shown this closure
More informationTheory of Computation (II) Yijia Chen Fudan University
Theory of Computation (II) Yijia Chen Fudan University Review A language L is a subset of strings over an alphabet Σ. Our goal is to identify those languages that can be recognized by one of the simplest
More informationComputational Models Lecture 2 1
Computational Models Lecture 2 1 Handout Mode Ronitt Rubinfeld and Iftach Haitner. Tel Aviv University. March 16/18, 2015 1 Based on frames by Benny Chor, Tel Aviv University, modifying frames by Maurice
More informationAutomata and Formal Languages - CM0081 Finite Automata and Regular Expressions
Automata and Formal Languages - CM0081 Finite Automata and Regular Expressions Andrés Sicard-Ramírez Universidad EAFIT Semester 2018-2 Introduction Equivalences DFA NFA -NFA RE Finite Automata and Regular
More informationCS 121, Section 2. Week of September 16, 2013
CS 121, Section 2 Week of September 16, 2013 1 Concept Review 1.1 Overview In the past weeks, we have examined the finite automaton, a simple computational model with limited memory. We proved that DFAs,
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 informationNondeterminism and Epsilon Transitions
Nondeterminism and Epsilon Transitions Mridul Aanjaneya Stanford University June 28, 22 Mridul Aanjaneya Automata Theory / 3 Challenge Problem Question Prove that any square with side length a power of
More informationRecap DFA,NFA, DTM. Slides by Prof. Debasis Mitra, FIT.
Recap DFA,NFA, DTM Slides by Prof. Debasis Mitra, FIT. 1 Formal Language Finite set of alphabets Σ: e.g., {0, 1}, {a, b, c}, { {, } } Language L is a subset of strings on Σ, e.g., {00, 110, 01} a finite
More informationGreat Theoretical Ideas in Computer Science. Lecture 4: Deterministic Finite Automaton (DFA), Part 2
5-25 Great Theoretical Ideas in Computer Science Lecture 4: Deterministic Finite Automaton (DFA), Part 2 January 26th, 27 Formal definition: DFA A deterministic finite automaton (DFA) M =(Q,,,q,F) M is
More informationLanguages. Non deterministic finite automata with ε transitions. First there was the DFA. Finite Automata. Non-Deterministic Finite Automata (NFA)
Languages Non deterministic finite automata with ε transitions Recall What is a language? What is a class of languages? Finite Automata Consists of A set of states (Q) A start state (q o ) A set of accepting
More informationOutline. Nondetermistic Finite Automata. Transition diagrams. A finite automaton is a 5-tuple (Q, Σ,δ,q 0,F)
Outline Nondeterminism Regular expressions Elementary reductions http://www.cs.caltech.edu/~cs20/a October 8, 2002 1 Determistic Finite Automata A finite automaton is a 5-tuple (Q, Σ,δ,q 0,F) Q is a finite
More informationNondeterministic finite automata
Lecture 3 Nondeterministic finite automata This lecture is focused on the nondeterministic finite automata (NFA) model and its relationship to the DFA model. Nondeterminism is an important concept in the
More informationNondeterministic Finite Automata. Nondeterminism Subset Construction
Nondeterministic Finite Automata Nondeterminism Subset Construction 1 Nondeterminism A nondeterministic finite automaton has the ability to be in several states at once. Transitions from a state on an
More informationHKN CS/ECE 374 Midterm 1 Review. Nathan Bleier and Mahir Morshed
HKN CS/ECE 374 Midterm 1 Review Nathan Bleier and Mahir Morshed For the most part, all about strings! String induction (to some extent) Regular languages Regular expressions (regexps) Deterministic finite
More informationRegular Languages. Problem Characterize those Languages recognized by Finite Automata.
Regular Expressions Regular Languages Fundamental Question -- Cardinality Alphabet = Σ is finite Strings = Σ is countable Languages = P(Σ ) is uncountable # Finite Automata is countable -- Q Σ +1 transition
More informationTheory of Languages and Automata
Theory of Languages and Automata Chapter 1- Regular Languages & Finite State Automaton Sharif University of Technology Finite State Automaton We begin with the simplest model of Computation, called finite
More informationCPS 220 Theory of Computation REGULAR LANGUAGES
CPS 22 Theory of Computation REGULAR LANGUAGES Introduction Model (def) a miniature representation of a thing; sometimes a facsimile Iraq village mockup for the Marines Scientific modelling - the process
More informationLecture 1: Finite State Automaton
Lecture 1: Finite State Automaton Instructor: Ketan Mulmuley Scriber: Yuan Li January 6, 2015 1 Deterministic Finite Automaton Informally, a deterministic finite automaton (DFA) has finite number of s-
More informationcse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska
cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska LECTURE 6 CHAPTER 2 FINITE AUTOMATA 2. Nondeterministic Finite Automata NFA 3. Finite Automata and Regular Expressions 4. Languages
More informationFinite Automata Part Two
Finite Automata Part Two DFAs A DFA is a Deterministic Finite Automaton A DFA is defined relative to some alphabet Σ. For each state in the DFA, there must be exactly one transition defined for each symbol
More informationCS 530: Theory of Computation Based on Sipser (second edition): Notes on regular languages(version 1.1)
CS 530: Theory of Computation Based on Sipser (second edition): Notes on regular languages(version 1.1) Definition 1 (Alphabet) A alphabet is a finite set of objects called symbols. Definition 2 (String)
More informationComputational Models - Lecture 1 1
Computational Models - Lecture 1 1 Handout Mode Ronitt Rubinfeld and Iftach Haitner. Tel Aviv University. February 29/ March 02, 2016 1 Based on frames by Benny Chor, Tel Aviv University, modifying frames
More informationAutomata & languages. A primer on the Theory of Computation. Laurent Vanbever. ETH Zürich (D-ITET) September,
Automata & languages A primer on the Theory of Computation Laurent Vanbever www.vanbever.eu ETH Zürich (D-ITET) September, 24 2015 Last week was all about Deterministic Finite Automaton We saw three main
More informationClosure under the Regular Operations
Closure under the Regular Operations Application of NFA Now we use the NFA to show that collection of regular languages is closed under regular operations union, concatenation, and star Earlier we have
More informationCSE443 Compilers. Dr. Carl Alphonce 343 Davis Hall
CSE443 Compilers Dr. Carl Alphonce alphonce@buffalo.edu 343 Davis Hall http://www.cse.buffalo.edu/faculty/alphonce/sp17/cse443/index.php https://piazza.com/class/iybn4ndqa1s3ei Syllabus Posted on website
More informationFooling Sets and. Lecture 5
Fooling Sets and Introduction to Nondeterministic Finite Automata Lecture 5 Proving that a language is not regular Given a language, we saw how to prove it is regular (union, intersection, concatenation,
More informationCISC 4090: Theory of Computation Chapter 1 Regular Languages. Section 1.1: Finite Automata. What is a computer? Finite automata
CISC 4090: Theory of Computation Chapter Regular Languages Xiaolan Zhang, adapted from slides by Prof. Werschulz Section.: Finite Automata Fordham University Department of Computer and Information Sciences
More informationPushdown automata. Twan van Laarhoven. Institute for Computing and Information Sciences Intelligent Systems Radboud University Nijmegen
Pushdown automata Twan van Laarhoven Institute for Computing and Information Sciences Intelligent Systems Version: fall 2014 T. van Laarhoven Version: fall 2014 Formal Languages, Grammars and Automata
More informationComputational Models - Lecture 4
Computational Models - Lecture 4 Regular languages: The Myhill-Nerode Theorem Context-free Grammars Chomsky Normal Form Pumping Lemma for context free languages Non context-free languages: Examples Push
More informationFORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY
5-453 FORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY 5-453 FORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY YOU NEED TO PICK UP THE SYLLABUS, THE COURSE SCHEDULE, THE PROJECT INFO SHEET, TODAY S CLASS NOTES
More informationCSC173 Workshop: 13 Sept. Notes
CSC173 Workshop: 13 Sept. Notes Frank Ferraro Department of Computer Science University of Rochester September 14, 2010 1 Regular Languages and Equivalent Forms A language can be thought of a set L of
More informationFinal exam study sheet for CS3719 Turing machines and decidability.
Final exam study sheet for CS3719 Turing machines and decidability. A Turing machine is a finite automaton with an infinite memory (tape). Formally, a Turing machine is a 6-tuple M = (Q, Σ, Γ, δ, q 0,
More informationWhat we have done so far
What we have done so far DFAs and regular languages NFAs and their equivalence to DFAs Regular expressions. Regular expressions capture exactly regular languages: Construct a NFA from a regular expression.
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 informationTheory of Computation p.1/?? Theory of Computation p.2/?? Unknown: Implicitly a Boolean variable: true if a word is
Abstraction of Problems Data: abstracted as a word in a given alphabet. Σ: alphabet, a finite, non-empty set of symbols. Σ : all the words of finite length built up using Σ: Conditions: abstracted as a
More informationLecture 17: Language Recognition
Lecture 17: Language Recognition Finite State Automata Deterministic and Non-Deterministic Finite Automata Regular Expressions Push-Down Automata Turing Machines Modeling Computation When attempting to
More informationComputational Models: Class 3
Computational Models: Class 3 Benny Chor School of Computer Science Tel Aviv University November 2, 2015 Based on slides by Maurice Herlihy, Brown University, and modifications by Iftach Haitner and Yishay
More informationCourse 4 Finite Automata/Finite State Machines
Course 4 Finite Automata/Finite State Machines The structure and the content of the lecture is based on (1) http://www.eecs.wsu.edu/~ananth/cpts317/lectures/index.htm, (2) W. Schreiner Computability and
More informationLecture Notes On THEORY OF COMPUTATION MODULE -1 UNIT - 2
BIJU PATNAIK UNIVERSITY OF TECHNOLOGY, ODISHA Lecture Notes On THEORY OF COMPUTATION MODULE -1 UNIT - 2 Prepared by, Dr. Subhendu Kumar Rath, BPUT, Odisha. UNIT 2 Structure NON-DETERMINISTIC FINITE AUTOMATA
More informationTheory of computation: initial remarks (Chapter 11)
Theory of computation: initial remarks (Chapter 11) For many purposes, computation is elegantly modeled with simple mathematical objects: Turing machines, finite automata, pushdown automata, and such.
More informationComputational Models Lecture 5
Computational Models Lecture 5 One More PDAs Example Equivalence of PDAs and CFLs Nondeterminism adds power to PDAs (not in book) Closure Properties of CFLs Algorithmic Aspects of PDAs and CFLs DFAs and
More informationRecitation 2 - Non Deterministic Finite Automata (NFA) and Regular OctoberExpressions
Recitation 2 - Non Deterministic Finite Automata (NFA) and Regular Expressions Orit Moskovich Gal Rotem Tel Aviv University October 28, 2015 Recitation 2 - Non Deterministic Finite Automata (NFA) and Regular
More informationDM17. Beregnelighed. Jacob Aae Mikkelsen
DM17 Beregnelighed Jacob Aae Mikkelsen January 12, 2007 CONTENTS Contents 1 Introduction 2 1.1 Operations with languages...................... 2 2 Finite Automata 3 2.1 Regular expressions/languages....................
More informationConstructions on Finite Automata
Constructions on Finite Automata Informatics 2A: Lecture 4 Alex Simpson School of Informatics University of Edinburgh als@inf.ed.ac.uk 23rd September, 2014 1 / 29 1 Closure properties of regular languages
More informationCSC236 Week 11. Larry Zhang
CSC236 Week 11 Larry Zhang 1 Announcements Next week s lecture: Final exam review This week s tutorial: Exercises with DFAs PS9 will be out later this week s. 2 Recap Last week we learned about Deterministic
More informationCSE 105 THEORY OF COMPUTATION
CSE 105 THEORY OF COMPUTATION "Winter" 2018 http://cseweb.ucsd.edu/classes/wi18/cse105-ab/ Today's learning goals Sipser Section 1.1 Design an automaton that recognizes a given language. Specify each of
More informationHarvard CS 121 and CSCI E-207 Lecture 4: NFAs vs. DFAs, Closure Properties
Harvard CS 121 and CSCI E-207 Lecture 4: NFAs vs. DFAs, Closure Properties Salil Vadhan September 13, 2012 Reading: Sipser, 1.2. How to simulate NFAs? NFA accepts w if there is at least one accepting computational
More informationCS243, Logic and Computation Nondeterministic finite automata
CS243, Prof. Alvarez NONDETERMINISTIC FINITE AUTOMATA (NFA) Prof. Sergio A. Alvarez http://www.cs.bc.edu/ alvarez/ Maloney Hall, room 569 alvarez@cs.bc.edu Computer Science Department voice: (67) 552-4333
More informationUses of finite automata
Chapter 2 :Finite Automata 2.1 Finite Automata Automata are computational devices to solve language recognition problems. Language recognition problem is to determine whether a word belongs to a language.
More informationComputational Models #1
Computational Models #1 Handout Mode Nachum Dershowitz & Yishay Mansour March 13-15, 2017 Nachum Dershowitz & Yishay Mansour Computational Models #1 March 13-15, 2017 1 / 41 Lecture Outline I Motivation
More informationChapter 6: NFA Applications
Chapter 6: NFA Applications Implementing NFAs The problem with implementing NFAs is that, being nondeterministic, they define a more complex computational procedure for testing language membership. To
More informationConstructions on Finite Automata
Constructions on Finite Automata Informatics 2A: Lecture 4 Mary Cryan School of Informatics University of Edinburgh mcryan@inf.ed.ac.uk 24 September 2018 1 / 33 Determinization The subset construction
More informationCPSC 421: Tutorial #1
CPSC 421: Tutorial #1 October 14, 2016 Set Theory. 1. Let A be an arbitrary set, and let B = {x A : x / x}. That is, B contains all sets in A that do not contain themselves: For all y, ( ) y B if and only
More informationFinite Automata. Seungjin Choi
Finite Automata Seungjin Choi Department of Computer Science and Engineering Pohang University of Science and Technology 77 Cheongam-ro, Nam-gu, Pohang 37673, Korea seungjin@postech.ac.kr 1 / 28 Outline
More informationCONCATENATION AND KLEENE STAR ON DETERMINISTIC FINITE AUTOMATA
1 CONCATENATION AND KLEENE STAR ON DETERMINISTIC FINITE AUTOMATA GUO-QIANG ZHANG, XIANGNAN ZHOU, ROBERT FRASER, LICONG CUI Department of Electrical Engineering and Computer Science, Case Western Reserve
More informationComputational Models - Lecture 3 1
Computational Models - Lecture 3 1 Handout Mode Iftach Haitner and Yishay Mansour. Tel Aviv University. March 13/18, 2013 1 Based on frames by Benny Chor, Tel Aviv University, modifying frames by Maurice
More informationCSE 105 THEORY OF COMPUTATION
CSE 105 THEORY OF COMPUTATION Spring 2016 http://cseweb.ucsd.edu/classes/sp16/cse105-ab/ Today's learning goals Sipser Ch 2 Define push down automata Trace the computation of a push down automaton Design
More informationCS 581: Introduction to the Theory of Computation! Lecture 1!
CS 581: Introduction to the Theory of Computation! Lecture 1! James Hook! Portland State University! hook@cs.pdx.edu! http://www.cs.pdx.edu/~hook/cs581f10/! Welcome!! Contact Information! Jim Hook! Office:
More informationConcatenation. The concatenation of two languages L 1 and L 2
Regular Expressions Problem Problem Set Set Four Four is is due due using using a late late period period in in the the box box up up front. front. Concatenation The concatenation of two languages L 1
More informationCMSC 330: Organization of Programming Languages
CMSC 330: Organization of Programming Languages Theory of Regular Expressions DFAs and NFAs Reminders Project 1 due Sep. 24 Homework 1 posted Exam 1 on Sep. 25 Exam topics list posted Practice homework
More informationFurther discussion of Turing machines
Further discussion of Turing machines In this lecture we will discuss various aspects of decidable and Turing-recognizable languages that were not mentioned in previous lectures. In particular, we will
More informationClosure Properties of Regular Languages
Closure Properties of Regular Languages Lecture 13 Section 4.1 Robb T. Koether Hampden-Sydney College Wed, Sep 21, 2016 Robb T. Koether (Hampden-Sydney College) Closure Properties of Regular Languages
More information