# Finite Automata. Reading: Chapter 2

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Finite Automata Reading: Chapter 2 1

2 Finite Automaton (FA) Informally, a state diagram that comprehensively captures all possible states and transitions that a machine can take while responding to a stream or sequence of input symbols Recognizer for Regular Languages Deterministic Finite Automata (DFA) The machine can exist in only one state at any given time Non-deterministic Finite Automata (NFA) The machine can exist in multiple states at the same time 2

3 Deterministic Finite Automata - Definition A Deterministic Finite Automaton (DFA) consists of: Q ==> a finite set of states ==> a finite set of input symbols (alphabet) q 0 ==> a start state F ==> set of accepting states δ ==> a transition function, which is a mapping between Q x ==> Q A DFA is defined by the 5-tuple: {Q,, q 0,F, δ } 3

4 What does a DFA do on reading an input string? Input: a word w in * Question: Is w acceptable by the DFA? Steps: Start at the start state q 0 For every input symbol in the sequence w do Compute the next state from the current state, given the current input symbol in w and the transition function If after all symbols in w are consumed, the current state is one of the accepting states (F) then accept w; Otherwise, reject w. 4

5 Regular Languages Let L(A) be a language recognized by a DFA A. Then L(A) is called a Regular Language. Locate regular languages in the Chomsky Hierarchy 5

6 The Chomsky Hierachy A containment t hierarchy h of classes of formal languages Regular Context- (DFA) free (PDA) Context- t sensitive (LBA) Recursivelyenumerable (TM) 6

7 Example #1 Build a DFA for the following language: L = {w w is a binary string that contains 01 as a substring} Steps for building a DFA to recognize L: = {0,1} Decide on the states: Q Designate start t state t and final state(s) t δ: Decide on the transitions: Final states == same as accepting states Other states == same as non-accepting states 7

8 Regular expression: (0+1)*01(0+1)* DFA for strings containing 01 What makes this DFA deterministic? Q={q 0,q 1,q 2 } 1 0,1 0 start q 0 0 q 1 1 q2 Accepting state = {0,1} start state = q 0 F = {q 2 } Transition table symbols 0 1 q 0 q 1 q 0 q 1 What if the language g allows q 1 q 1 q 2 empty strings? *q 2 q 2 q 2 stat tes 8

9 Example #2 Clamping Logic: A clamping circuit waits for a 1 input, and turns on forever. However, to avoid clamping on spurious noise, we ll design a DFA that waits for two consecutive 1s in a row before clamping on. Build a DFA for the following language: L = { w w is a bit string which contains the substring 11} State Design: q 0 : start state (initially off), also means the most recent input was not a 1 q 1 : has never seen 11 but the most recent input was a 1 q 2 : has seen 11 at least once 9

10 Example #3 Build a DFA for the following language: L = { w w is a binary string that has even number of 1s and even number of 0s}? 10

11 Extension of transitions (δ) to Paths (δ) δ (q,w) = destination state from state q on input string w δ (q,wa) = δ (δ(q,w), a) Work out example #3 using the input sequence w=10010, a=1: δ (q 0,wa) =? 11

12 Language of a DFA A DFA A accepts string w if there is a path from q 0 to an accepting (or final) state that is labeled by w i.e., L(A) = { w δ(q 0,w) F } I.e., L(A) = all strings that lead to an accepting state from q 0 12

13 Non-deterministic Finite Automata (NFA) A Non-deterministic Finite Automaton (NFA) is of course non-deterministic Implying that the machine can exist in more than one state at the same time Transitions could be non-deterministic q i 1 1 q j q k Each transition function therefore maps to a set of states 13

14 Non-deterministic Finite Automata (NFA) A Non-deterministic Finite Automaton (NFA) consists of: Q ==> a finite set of states ==> a finite set of input symbols (alphabet) q 0 ==> a start state F ==> set of accepting states δ ==> a transition function, which is a mapping between Q x ==> subset of Q An NFA is also defined by the 5-tuple: {Q,, q 0,F, δ } 14

15 How to use an NFA? Input: a word w in * Question: Is w acceptable by the NFA? Steps: Start at the start state q 0 For every input symbol in the sequence w do Determine all possible next states from all current states, given the current input symbol in w and the transition function If after all symbols in w are consumed and if at least one of the current states is a final state then accept w; Otherwise, reject w. 15

16 Regular expression: (0+1)*01(0+1)* NFA for strings containing 01 Why is this non-deterministic? 0,1 0,1 start 0 1 q2 q 0 q 1 What will happen if at state q 1 an input of 0 is received? ed Final state sta ates Q={q 0,q 1,q 2 } = {0,1} start state = q 0 F = {q 2 } Transition table symbols 0 1 q 0 {q 0,q 1 } {q 0 } q 1 Φ {q 2 } *q 2 {q 2 } {q 2 } 16

17 Note: Omitting to explicitly show error states is just a matter of design convenience (one that is generally followed for NFAs), and i.e., this feature should not be confused with the notion of non-determinism. What is an error state? A DFA for recognizing the key word while w h i l e q 0 w q1 h q2 i q 3 q 4 q 5 Any other input symbol q err Any symbol An NFA for the same purpose: w h i l e q 0 q 1 q 2 q 3 q 4 q 5 Transitions into a dead state are implicit 17

18 Example #2 Build an NFA for the following language: L = { w w ends in 01}? Other examples Keyword recognizer (e.g., if, then, else, while, for, include, etc.) Strings where the first symbol is present somewhere later on at least once 18

19 Extension of δ to NFA Paths Basis: δ (q, ) = {q} Induction: Let δ (q 0,w) = {p 1,p 2,p k } δ (p i,a) = S i for i=1,2...,k Then, δ (q 0,wa) = S 1 US 2 U US U k 19

20 Language of an NFA An NFA accepts w if there exists at least one path from the start state to an accepting (or final) state that is labeled by w L(N) = { w δ(q 0,w) F Φ } 20

21 Advantages & Caveats for NFA Great for modeling regular expressions String processing - e.g., grep, lexical analyzer Could a non-deterministic state machine be implemented in practice? Probabilistic models could be viewed as extensions of non- deterministic state machines (e.g., toss of a coin, a roll of dice) They are not the same though A parallel computer could exist in multiple states at the same time 21

22 Technologies for NFAs Micron s Automata Processor (introduced in 2013) 2D array of MISD (multiple instruction single data) fabric w/ thousands to millions of processing elements. 1 input symbol = fed to all states (i.e., cores) Non-determinism using circuits 22

23 But, DFAs and NFAs are equivalent in their power to capture langauges!! Differences: DFA vs. NFA DFA 1. All transitions are deterministic Each transition leads to exactly one state 2. For each state, transition on all possible symbols (alphabet) should be defined 3. Accepts input if the last state visited is in F 4. Sometimes harder to construct because of the number of states 5. Practical implementation is feasible NFA 1. Some transitions could be non-deterministic A transition could lead to a subset of states 2. Not all symbol transitions need to be defined explicitly (if undefined will go to an error state this is just a design convenience, not to be confused with nondeterminism ) 3. Accepts input if one of the last states is in F 4. Generally easier than a DFA to construct 5. Practical implementations ti limited but emerging (e.g., Micron automata processor) 23

24 Equivalence of DFA & NFA Should be true for any L Theorem: A language L is accepted by a DFA if and only if it is accepted by an NFA. Proof: 1. If part: Prove by showing every NFA can be converted to an equivalent DFA (in the next few slides ) 2. Only-if part is trivial: Every DFA is a special case of an NFA where each state t has exactly one transition for every input symbol. Therefore, if L is accepted by a DFA, it is accepted by a corresponding NFA. 24

25 Proof for the if-part If-part: A language L is accepted by a DFA if it is accepted by an NFA rephrasing Given any NFA N, we can construct a DFA D such that L(N)=L(D) How to convert an NFA into a DFA? Observation: In an NFA, each transition maps to a subset of states Idea: Represent: each h subset of fnfa_states t a single DFA_state t Subset construction 25

26 NFA to DFA by subset construction Let N = {Q N,,δ N,q 0,F N } Goal: Build D={Q D,,δ D D,{q 0 },F D D} s.t. L(D)=L(N) Construction: 1. Q D = all subsets of Q N (i.e., power set) 2. F D =set of subsets S of Q N s.t. S F N Φ 3. δ D : for each subset S of Q N and for each input symbol a in : δ D (S,a) =Uδ δ N (p,a) p in s 26

27 Idea: To avoid enumerating all of power set, do lazy creation of states NFA to DFA construction: Example NFA: 01 0,1 L = {w w ends in 01} 0 q 0 q 1 1 q 2 DFA: [q 0 ] [q 0,q 1 ] 0 [q 0,q 2 ] 1 δ N 0 1 δ D 0 1 δ D 0 1 Ø Ø Ø [q 0 ] [q 0,q 1 ] [q 0 ] q 0 {q 0,q 1 } {q 0 } [q 0 ] {q 0,q 1 } {q 0 } [q 0,q 1 ] [q 0,q 1 ] [q 0,q 2 ] q 1 Ø {q 2 } [q 1 ] Ø {q 2 } *[q 0,q 2 ] [q 0,q 1 ] [q 0 ] *q 2 Ø Ø *[q 2 ] Ø Ø [q 0,q 1 ] {q 0,q 1 } {q 0,q 2 } *[q 0,q 2 ] {q 0,q 1 } {q 0 } *[q 1,q 2 ] Ø {q 2 } *[q 0,q 1,q 2 ] {q 0,q 1 } {q 0,q 2 } 0. Enumerate all possible subsets 1. Determine transitions 2. Retain only those states reachable from {q 0 } 27

28 NFA to DFA: Repeating the example using LAZY CREATION NFA: 01 0,1 L = {w w ends in 01} 0 q 0 q 1 1 q 2 DFA: [q 0 ] [q 0,q 1 ] 0 [q 0,q 2 ] 1 δ N 0 1 q 0 {q 0,q 1 } {q 0 } q 1 Ø {q 2 } δ D 0 1 [q 0 ] [q 0,q 1 ] [q 0 ] [q 0,q 1 ] [q 0,q 1 ] [q 0,q 2 ] *q 2 Ø Ø *[q 0,q 2 ] [q 0,q 1 ] [q 0 ] Main Idea: Introduce states as you go (on a need basis) 28

29 Correctness of subset construction Theorem: If D is the DFA constructed from NFA N by subset construction, then L(D)=L(N) Proof: Show that δ D ({q 0 },w) δ N (q 0,w}, for all w Using induction on w s ws length: Let w = xa δ D ({q 0 }xa) },xa) δ D ( δ N (q 0,x}, a ) δ N (q 0,w} 29

30 A bad case where #states(dfa)>>#states(nfa) L = {w w is a binary string s.t., the k th symbol from its end is a 1} NFA has k+1 states But an equivalent DFA needs to have at least 2 k states (Pigeon hole principle) m holes and >m pigeons => at least one hole has to contain two or more pigeons 30

31 Applications Text indexing inverted indexing For each unique word in the database, store all locations that contain it using an NFA or a DFA Find pattern P in text t T Example: Google querying Et Extensions of fthis idea: PATRICIA tree, suffix tree 31

32 A few subtle properties p of DFAs and NFAs The machine never really terminates. It is always waiting for the next input symbol or making transitions. The machine decides when to consume the next symbol from the input and when to ignore it. (but the machine can never skip a symbol) => A transition can happen even without really consuming an input symbol (think of consuming as a free token) if this happens, then it becomes an -NFA (see next few slides). A single transition cannot consume more than one (non- ) symbol. 32

33 FA with -Transitions We can allow explicit -transitions in finite automata i.e., a transition from one state to another state without consuming any additional input symbol Explicit it -transitions t between different states t introduce non-determinism. Makes it easier e sometimes es to construct NFAs Definition: -NFAs are those NFAs with at least one explicit -transition defined. -NFAs have one more column in their transition table 33

34 Example of an -NFA L = {w w is empty, or if non-empty will end in 01} start q 0 0,1 δ E q 0 q 1 *q 0 Ø Ø {q 0,q 0 } q 0 {q 0,q 1 } {q 0 } {q 0 } q 1 Ø {q 2 } {q 1 } q 2 ECLOSE(q 0 ) ECLOSE(q 0 ) ECLOSE(q 1 ) -closure of a state q, ECLOSE(q), is the set of all states (including itself) that can be reached from q by repeatedly making an arbitrary number of - transitions. *q 2 Ø Ø {q 2 } ECLOSE(q 2 ) 34

35 To simulate any transition: Step 1) Go to all immediate destination states. Step 2) From there go to all their -closure states as well. Example of an -NFA L = {w w is empty, or if non-empty will end in 01} start 0,1 0 1 q 0 q 1 q 2 Simulate for w=101: q 0 q 0 q 0 q δ E 0 1 *q 0 Ø Ø {q 0,q 0 } q 0 {q 0,q 1 } {q 0 } {q 0 } q 1 Ø {q 2 } {q 1 } *q 2 Ø Ø {q 2 } ECLOSE(q 0 ) ECLOSE(q 0 ) Ø x q 0 1 q 0 q 1 q 2 35

36 To simulate any transition: Step 1) Go to all immediate destination states. Step 2) From there go to all their -closure states as well. Example of another -NFA start 0,1 0 1 q 0 q 1 q 2 1 q 0 q 3 Simulate for w=101:? δ E 0 1 *q 0 Ø Ø {q 0,q 0,q 3 } q 0 {q 0,q 1 } {q 0 } {q 0, q 3 } q 1 Ø {q 2 } {q 1 } *q 2 Ø Ø {q 2 } q 3 Ø {q 2 } {q 3 } 36

37 Equivalency of DFA, NFA, -NFA Theorem: A language L is accepted by some -NFA if and only if L is accepted by some DFA Implication: DFA NFA -NFA (all accept Regular Languages) 37

38 Eliminating -transitions Let E = {Q E,,δ E,q 0,F E } be an -NFA Goal: To build DFA D={Q D,,δ D,{q D },F D } s.t. L(D)=L(E) Construction: ti 1. Q D = all reachable subsets of Q E factoring in -closures 2. q D = ECLOSE(q 0 ) 3. F D =subsets S in Q D s.t. S F E Φ 4. δ D : for each subset S of Q E and for each input symbol a : Let R= U δ E (p,a) // go to destination states p in s δ D D( (S,a) = U ECLOSE(r) () // from there, take a union r in R of all their -closures Reading: Section in book 38

39 Example: -NFA DFA L = {w w is empty, or if non-empty will end in 01} 0,1 start q q 0 q 1 q 2 δ E 0 1 *q 0 Ø Ø {q 0,q 0 } q 0 {q 0,q 1 } {q 0 } {q 0 } q 1 Ø {q 2 } {q 1 } *q 2 Ø Ø {q 2 } δ D 0 1 *{q 0,q 0 } 39

40 Example: -NFA DFA start L = {w w is empty, or if non-empty will end in 01} 0,1 0 1 q 0 q 1 start {q q 0, q 0 } 0 δ E 0 1 ECLOSE q 2 *q 0 Ø Ø {q 0,q 0 } q 0 {q 0,q 1 } {q 0 } {q 0 } q 1 Ø {q 2 } {q 1 } *q 2 Ø Ø {q 2 } union 0 0 {q 0,q 1 } 1 0 q 0 δ D *{q 0,q 0 } {q 0,q 1 } {q 0 } {q 0,q 1 } {q 0,q 1 } {q 0,q 2 } {q 0 } {q 0,q 1 } {q 0 } *{q 0,q 2 } {q 0,q 1 } {q 0 } {q 0,q 2 } 1 40

41 Summary DFA Definition Transition diagrams & tables Regular language NFA Definition Transition diagrams & tables DFA vs. NFA NFA to DFA conversion using subset construction Equivalency of DFA & NFA Removal of redundant states and including dead states -transitions in NFA Pigeon hole principles Text searching applications 41

### Finite Automata. Reading: Chapter 2

Finite Automata Reading: Chapter 2 1 Finite Automata Informally, a state machine that comprehensively captures all possible states and transitions that a machine can take while responding to a stream (or

### Automata and Languages

Automata and Languages Computational Models: An idealized mathematical model of a computer. A computational model may be accurate in some ways but not in others. We shall be defining increasingly powerful

### FORMAL LANGUAGES, AUTOMATA AND COMPUTATION

FORMAL LANGUAGES, AUTOMATA AND COMPUTATION REDUCIBILITY ( LECTURE 16) SLIDES FOR 15-453 SPRING 2011 1 / 20 THE LANDSCAPE OF THE CHOMSKY HIERARCHY ( LECTURE 16) SLIDES FOR 15-453 SPRING 2011 2 / 20 REDUCIBILITY

### 6.045: Automata, Computability, and Complexity Or, Great Ideas in Theoretical Computer Science Spring, 2010. Class 4 Nancy Lynch

6.045: Automata, Computability, and Complexity Or, Great Ideas in Theoretical Computer Science Spring, 2010 Class 4 Nancy Lynch Today Two more models of computation: Nondeterministic Finite Automata (NFAs)

### Formal Languages and Automata Theory - Regular Expressions and Finite Automata -

Formal Languages and Automata Theory - Regular Expressions and Finite Automata - Samarjit Chakraborty Computer Engineering and Networks Laboratory Swiss Federal Institute of Technology (ETH) Zürich March

### Introduction to Automata Theory. Reading: Chapter 1

Introduction to Automata Theory Reading: Chapter 1 1 What is Automata Theory? Study of abstract computing devices, or machines Automaton = an abstract computing device Note: A device need not even be a

### Motivation. Automata = abstract computing devices. Turing studied Turing Machines (= computers) before there were any real computers

Motivation Automata = abstract computing devices Turing studied Turing Machines (= computers) before there were any real computers We will also look at simpler devices than Turing machines (Finite State

### Automata and Computability. Solutions to Exercises

Automata and Computability Solutions to Exercises Fall 25 Alexis Maciel Department of Computer Science Clarkson University Copyright c 25 Alexis Maciel ii Contents Preface vii Introduction 2 Finite Automata

### The Halting Problem is Undecidable

185 Corollary G = { M, w w L(M) } is not Turing-recognizable. Proof. = ERR, where ERR is the easy to decide language: ERR = { x { 0, 1 }* x does not have a prefix that is a valid code for a Turing machine

### CSC4510 AUTOMATA 2.1 Finite Automata: Examples and D efinitions Definitions

CSC45 AUTOMATA 2. Finite Automata: Examples and Definitions Finite Automata: Examples and Definitions A finite automaton is a simple type of computer. Itsoutputislimitedto yes to or no. It has very primitive

### Theory of Computation

Theory of Computation For Computer Science & Information Technology By www.thegateacademy.com Syllabus Syllabus for Theory of Computation Regular Expressions and Finite Automata, Context-Free Grammar s

### CS154. Turing Machines. Turing Machine. Turing Machines versus DFAs FINITE STATE CONTROL AI N P U T INFINITE TAPE. read write move.

CS54 Turing Machines Turing Machine q 0 AI N P U T IN TAPE read write move read write move Language = {0} q This Turing machine recognizes the language {0} Turing Machines versus DFAs TM can both write

### Regular Expressions and Automata using Haskell

Regular Expressions and Automata using Haskell Simon Thompson Computing Laboratory University of Kent at Canterbury January 2000 Contents 1 Introduction 2 2 Regular Expressions 2 3 Matching regular expressions

### Finite Automata and Regular Languages

CHAPTER 3 Finite Automata and Regular Languages 3. Introduction 3.. States and Automata A finite-state machine or finite automaton (the noun comes from the Greek; the singular is automaton, the Greek-derived

### Finite Automata and Formal Languages

Finite Automata and Formal Languages TMV026/DIT321 LP4 2011 Lecture 14 May 19th 2011 Overview of today s lecture: Turing Machines Push-down Automata Overview of the Course Undecidable and Intractable Problems

### CSE 135: Introduction to Theory of Computation Decidability and Recognizability

CSE 135: Introduction to Theory of Computation Decidability and Recognizability Sungjin Im University of California, Merced 04-28, 30-2014 High-Level Descriptions of Computation Instead of giving a Turing

### Compiler Construction

Compiler Construction Regular expressions Scanning Görel Hedin Reviderad 2013 01 23.a 2013 Compiler Construction 2013 F02-1 Compiler overview source code lexical analysis tokens intermediate code generation

### 3515ICT Theory of Computation Turing Machines

Griffith University 3515ICT Theory of Computation Turing Machines (Based loosely on slides by Harald Søndergaard of The University of Melbourne) 9-0 Overview Turing machines: a general model of computation

### 6.080/6.089 GITCS Feb 12, 2008. Lecture 3

6.8/6.89 GITCS Feb 2, 28 Lecturer: Scott Aaronson Lecture 3 Scribe: Adam Rogal Administrivia. Scribe notes The purpose of scribe notes is to transcribe our lectures. Although I have formal notes of my

### Reading 13 : Finite State Automata and Regular Expressions

CS/Math 24: Introduction to Discrete Mathematics Fall 25 Reading 3 : Finite State Automata and Regular Expressions Instructors: Beck Hasti, Gautam Prakriya In this reading we study a mathematical model

### Regular Languages and Finite State Machines

Regular Languages and Finite State Machines Plan for the Day: Mathematical preliminaries - some review One application formal definition of finite automata Examples 1 Sets A set is an unordered collection

### Automata on Infinite Words and Trees

Automata on Infinite Words and Trees Course notes for the course Automata on Infinite Words and Trees given by Dr. Meghyn Bienvenu at Universität Bremen in the 2009-2010 winter semester Last modified:

### Automata and Formal Languages

Automata and Formal Languages Winter 2009-2010 Yacov Hel-Or 1 What this course is all about This course is about mathematical models of computation We ll study different machine models (finite automata,

### Theory of Computation Prof. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras

Theory of Computation Prof. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras Lecture No. # 31 Recursive Sets, Recursively Innumerable Sets, Encoding

### Scanner. tokens scanner parser IR. source code. errors

Scanner source code tokens scanner parser IR errors maps characters into tokens the basic unit of syntax x = x + y; becomes = + ; character string value for a token is a lexeme

### Formal Deænition of Finite Automaton. 1. Finite set of states, typically Q. 2. Alphabet of input symbols, typically æ.

Formal Denition of Finite Automaton 1. Finite set of states, typically Q. 2. Alphabet of input symbols, typically. 3. One state is the startèinitial state, typically q 0. 4. Zero or more nalèaccepting

### C H A P T E R Regular Expressions regular expression

7 CHAPTER Regular Expressions Most programmers and other power-users of computer systems have used tools that match text patterns. You may have used a Web search engine with a pattern like travel cancun

### CS 3719 (Theory of Computation and Algorithms) Lecture 4

CS 3719 (Theory of Computation and Algorithms) Lecture 4 Antonina Kolokolova January 18, 2012 1 Undecidable languages 1.1 Church-Turing thesis Let s recap how it all started. In 1990, Hilbert stated a

### Honors Class (Foundations of) Informatics. Tom Verhoeff. Department of Mathematics & Computer Science Software Engineering & Technology

Honors Class (Foundations of) Informatics Tom Verhoeff Department of Mathematics & Computer Science Software Engineering & Technology www.win.tue.nl/~wstomv/edu/hci c 2011, T. Verhoeff @ TUE.NL 1/20 Information

### Deterministic Finite Automata

1 Deterministic Finite Automata Definition: A deterministic finite automaton (DFA) consists of 1. a finite set of states (often denoted Q) 2. a finite set Σ of symbols (alphabet) 3. a transition function

CS5236 Advanced Automata Theory Frank Stephan Semester I, Academic Year 2012-2013 Advanced Automata Theory is a lecture which will first review the basics of formal languages and automata theory and then

### Regular Languages and Finite Automata

Regular Languages and Finite Automata 1 Introduction Hing Leung Department of Computer Science New Mexico State University Sep 16, 2010 In 1943, McCulloch and Pitts [4] published a pioneering work on a

### (IALC, Chapters 8 and 9) Introduction to Turing s life, Turing machines, universal machines, unsolvable problems.

3130CIT: Theory of Computation Turing machines and undecidability (IALC, Chapters 8 and 9) Introduction to Turing s life, Turing machines, universal machines, unsolvable problems. An undecidable problem

### Turing Machines: An Introduction

CIT 596 Theory of Computation 1 We have seen several abstract models of computing devices: Deterministic Finite Automata, Nondeterministic Finite Automata, Nondeterministic Finite Automata with ɛ-transitions,

### Pushdown Automata. place the input head on the leftmost input symbol. while symbol read = b and pile contains discs advance head remove disc from pile

Pushdown Automata In the last section we found that restricting the computational power of computing devices produced solvable decision problems for the class of sets accepted by finite automata. But along

### T-79.186 Reactive Systems: Introduction and Finite State Automata

T-79.186 Reactive Systems: Introduction and Finite State Automata Timo Latvala 14.1.2004 Reactive Systems: Introduction and Finite State Automata 1-1 Reactive Systems Reactive systems are a class of software

### Structural properties of oracle classes

Structural properties of oracle classes Stanislav Živný Computing Laboratory, University of Oxford, Wolfson Building, Parks Road, Oxford, OX1 3QD, UK Abstract Denote by C the class of oracles relative

### Genetic programming with regular expressions

Genetic programming with regular expressions Børge Svingen Chief Technology Officer, Open AdExchange bsvingen@openadex.com 2009-03-23 Pattern discovery Pattern discovery: Recognizing patterns that characterize

### 1 Definition of a Turing machine

Introduction to Algorithms Notes on Turing Machines CS 4820, Spring 2012 April 2-16, 2012 1 Definition of a Turing machine Turing machines are an abstract model of computation. They provide a precise,

### Discrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note 11

CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note Conditional Probability A pharmaceutical company is marketing a new test for a certain medical condition. According

### 24 Uses of Turing Machines

Formal Language and Automata Theory: CS2004 24 Uses of Turing Machines 24 Introduction We have previously covered the application of Turing Machine as a recognizer and decider In this lecture we will discuss

### Theory of Computation Chapter 2: Turing Machines

Theory of Computation Chapter 2: Turing Machines Guan-Shieng Huang Feb. 24, 2003 Feb. 19, 2006 0-0 Turing Machine δ K 0111000a 01bb 1 Definition of TMs A Turing Machine is a quadruple M = (K, Σ, δ, s),

### Inf1A: Deterministic Finite State Machines

Lecture 2 InfA: Deterministic Finite State Machines 2. Introduction In this lecture we will focus a little more on deterministic Finite State Machines. Also, we will be mostly concerned with Finite State

### Computational Models Lecture 8, Spring 2009

Slides modified by Benny Chor, based on original slides by Maurice Herlihy, Brown Univ. p. 1 Computational Models Lecture 8, Spring 2009 Encoding of TMs Universal Turing Machines The Halting/Acceptance

### Overview of E0222: Automata and Computability

Overview of E0222: Automata and Computability Deepak D Souza Department of Computer Science and Automation Indian Institute of Science, Bangalore. August 3, 2011 What this course is about What we study

### SRM UNIVERSITY FACULTY OF ENGINEERING & TECHNOLOGY SCHOOL OF COMPUTING DEPARTMENT OF SOFTWARE ENGINEERING COURSE PLAN

Course Code : CS0355 SRM UNIVERSITY FACULTY OF ENGINEERING & TECHNOLOGY SCHOOL OF COMPUTING DEPARTMENT OF SOFTWARE ENGINEERING COURSE PLAN Course Title : THEORY OF COMPUTATION Semester : VI Course : June

### INSTITUTE OF AERONAUTICAL ENGINEERING

INSTITUTE OF AERONAUTICAL ENGINEERING DUNDIGAL 500 043, HYDERABAD COMPUTER SCIENCE AND ENGINEERING TUTORIAL QUESTION BANK Name : FORMAL LANGUAGES AND AUTOMATA THEORY Code : A40509 Class : II B. Tech II

### Informatique Fondamentale IMA S8

Informatique Fondamentale IMA S8 Cours 1 - Intro + schedule + finite state machines Laure Gonnord http://laure.gonnord.org/pro/teaching/ Laure.Gonnord@polytech-lille.fr Université Lille 1 - Polytech Lille

### Sets and Subsets. Countable and Uncountable

Sets and Subsets Countable and Uncountable Reading Appendix A Section A.6.8 Pages 788-792 BIG IDEAS Themes 1. There exist functions that cannot be computed in Java or any other computer language. 2. There

### We give a basic overview of the mathematical background required for this course.

1 Background We give a basic overview of the mathematical background required for this course. 1.1 Set Theory We introduce some concepts from naive set theory (as opposed to axiomatic set theory). The

### Automata Theory. Şubat 2006 Tuğrul Yılmaz Ankara Üniversitesi

Automata Theory Automata theory is the study of abstract computing devices. A. M. Turing studied an abstract machine that had all the capabilities of today s computers. Turing s goal was to describe the

### Properties of Stabilizing Computations

Theory and Applications of Mathematics & Computer Science 5 (1) (2015) 71 93 Properties of Stabilizing Computations Mark Burgin a a University of California, Los Angeles 405 Hilgard Ave. Los Angeles, CA

### Computing Functions with Turing Machines

CS 30 - Lecture 20 Combining Turing Machines and Turing s Thesis Fall 2008 Review Languages and Grammars Alphabets, strings, languages Regular Languages Deterministic Finite and Nondeterministic Automata

### CAs and Turing Machines. The Basis for Universal Computation

CAs and Turing Machines The Basis for Universal Computation What We Mean By Universal When we claim universal computation we mean that the CA is capable of calculating anything that could possibly be calculated*.

### Pushdown automata. Informatics 2A: Lecture 9. Alex Simpson. 3 October, 2014. School of Informatics University of Edinburgh als@inf.ed.ac.

Pushdown automata Informatics 2A: Lecture 9 Alex Simpson School of Informatics University of Edinburgh als@inf.ed.ac.uk 3 October, 2014 1 / 17 Recap of lecture 8 Context-free languages are defined by context-free

### Diagonalization. Ahto Buldas. Lecture 3 of Complexity Theory October 8, 2009. Slides based on S.Aurora, B.Barak. Complexity Theory: A Modern Approach.

Diagonalization Slides based on S.Aurora, B.Barak. Complexity Theory: A Modern Approach. Ahto Buldas Ahto.Buldas@ut.ee Background One basic goal in complexity theory is to separate interesting complexity

### Regular Expressions. Languages. Recall. A language is a set of strings made up of symbols from a given alphabet. Computer Science Theory 2

Regular Expressions Languages Recall. A language is a set of strings made up of symbols from a given alphabet. Computer Science Theory 2 1 String Recognition Machine Given a string and a definition of

### On Winning Conditions of High Borel Complexity in Pushdown Games

Fundamenta Informaticae (2005) 1 22 1 IOS Press On Winning Conditions of High Borel Complexity in Pushdown Games Olivier Finkel Equipe de Logique Mathématique U.F.R. de Mathématiques, Université Paris

### Philadelphia University Faculty of Information Technology Department of Computer Science First Semester, 2007/2008.

Philadelphia University Faculty of Information Technology Department of Computer Science First Semester, 2007/2008 Course Syllabus Course Title: Theory of Computation Course Level: 3 Lecture Time: Course

### Computability Theory

CSC 438F/2404F Notes (S. Cook and T. Pitassi) Fall, 2014 Computability Theory This section is partly inspired by the material in A Course in Mathematical Logic by Bell and Machover, Chap 6, sections 1-10.

### Applications of Methods of Proof

CHAPTER 4 Applications of Methods of Proof 1. Set Operations 1.1. Set Operations. The set-theoretic operations, intersection, union, and complementation, defined in Chapter 1.1 Introduction to Sets are

### Semantics of UML class diagrams

1 Otto-von-Guericke Universität Magdeburg, Germany April 26, 2016 Sets Definition (Set) A set is a collection of objects. The basic relation is membership: x A (x is a member of A) The following operations

### Notes. Sets. Notes. Introduction II. Notes. Definition. Definition. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry.

Sets Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Spring 2006 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 1.6 1.7 of Rosen cse235@cse.unl.edu Introduction

### Graph Theory Problems and Solutions

raph Theory Problems and Solutions Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles November, 005 Problems. Prove that the sum of the degrees of the vertices of any finite graph is

### POWER SETS AND RELATIONS

POWER SETS AND RELATIONS L. MARIZZA A. BAILEY 1. The Power Set Now that we have defined sets as best we can, we can consider a sets of sets. If we were to assume nothing, except the existence of the empty

### Deterministic Push-Down Store Automata

Deterministic Push-Down tore Automata 1 Context-Free Languages A B C D... A w 0 w 1 D...E The languagea n b n : a b ab 2 Finite-tate Automata 3 Pushdown Automata Pushdown automata (pda s) is an fsa with

### An Overview of a Compiler

An Overview of a Compiler Department of Computer Science and Automation Indian Institute of Science Bangalore 560 012 NPTEL Course on Principles of Compiler Design Outline of the Lecture About the course

### Computer Architecture Syllabus of Qualifying Examination

Computer Architecture Syllabus of Qualifying Examination PhD in Engineering with a focus in Computer Science Reference course: CS 5200 Computer Architecture, College of EAS, UCCS Created by Prof. Xiaobo

### Introduction to Turing Machines

Automata Theory, Languages and Computation - Mírian Halfeld-Ferrari p. 1/2 Introduction to Turing Machines SITE : http://www.sir.blois.univ-tours.fr/ mirian/ Automata Theory, Languages and Computation

### CS103B Handout 17 Winter 2007 February 26, 2007 Languages and Regular Expressions

CS103B Handout 17 Winter 2007 February 26, 2007 Languages and Regular Expressions Theory of Formal Languages In the English language, we distinguish between three different identities: letter, word, sentence.

### Turing Machine and the Conceptual Problems of Computational Theory

Research Inventy: International Journal of Engineering And Science Vol.4, Issue 4 (April 204), PP 53-60 Issn (e): 2278-472, Issn (p):239-6483, www.researchinventy.com Turing Machine and the Conceptual

### Composability of Infinite-State Activity Automata*

Composability of Infinite-State Activity Automata* Zhe Dang 1, Oscar H. Ibarra 2, Jianwen Su 2 1 Washington State University, Pullman 2 University of California, Santa Barbara Presented by Prof. Hsu-Chun

### Turing Machines, Part I

Turing Machines, Part I Languages The \$64,000 Question What is a language? What is a class of languages? Computer Science Theory 2 1 Now our picture looks like Context Free Languages Deterministic Context

### Domain Theory: An Introduction

Domain Theory: An Introduction Robert Cartwright Rebecca Parsons Rice University This monograph is an unauthorized revision of Lectures On A Mathematical Theory of Computation by Dana Scott [3]. Scott

### ω-automata Automata that accept (or reject) words of infinite length. Languages of infinite words appear:

ω-automata ω-automata Automata that accept (or reject) words of infinite length. Languages of infinite words appear: in verification, as encodings of non-terminating executions of a program. in arithmetic,

### An Exponential Gap between LasVegas and Deterministic Sweeping Finite Automata

An Exponential Gap between LasVegas and Deterministic Sweeping Finite Automata Christos Kapoutsis, Richard Královič, and Tobias Mömke Department of Computer Science, ETH Zürich Abstract. A two-way finite

### Increasing Interaction and Support in the Formal Languages and Automata Theory Course

Increasing Interaction and Support in the Formal Languages and Automata Theory Course [Extended Abstract] Susan H. Rodger rodger@cs.duke.edu Jinghui Lim Stephen Reading ABSTRACT The introduction of educational

### Discrete Mathematics Lecture 5. Harper Langston New York University

Discrete Mathematics Lecture 5 Harper Langston New York University Empty Set S = {x R, x 2 = -1} X = {1, 3}, Y = {2, 4}, C = X Y (X and Y are disjoint) Empty set has no elements Empty set is a subset of

### Course Manual Automata & Complexity 2015

Course Manual Automata & Complexity 2015 Course code: Course homepage: Coordinator: Teachers lectures: Teacher exercise classes: Credits: X_401049 http://www.cs.vu.nl/~tcs/ac prof. dr. W.J. Fokkink home:

### Lecture 2: Regular Languages [Fa 14]

Caveat lector: This is the first edition of this lecture note. Please send bug reports and suggestions to jeffe@illinois.edu. But the Lord came down to see the city and the tower the people were building.

### Combinatorics: The Fine Art of Counting

Combinatorics: The Fine Art of Counting Week 7 Lecture Notes Discrete Probability Continued Note Binomial coefficients are written horizontally. The symbol ~ is used to mean approximately equal. The Bernoulli

### Lecture I FINITE AUTOMATA

1. Regular Sets and DFA Lecture I Page 1 Lecture I FINITE AUTOMATA Lecture 1: Honors Theory, Spring 02, Yap We introduce finite automata (deterministic and nondeterministic) and regular languages. Some

### Today s Agenda. Automata and Logic. Quiz 4 Temporal Logic. Introduction Buchi Automata Linear Time Logic Summary

Today s Agenda Quiz 4 Temporal Logic Formal Methods in Software Engineering 1 Automata and Logic Introduction Buchi Automata Linear Time Logic Summary Formal Methods in Software Engineering 2 1 Buchi Automata

### Notes on Complexity Theory Last updated: August, 2011. Lecture 1

Notes on Complexity Theory Last updated: August, 2011 Jonathan Katz Lecture 1 1 Turing Machines I assume that most students have encountered Turing machines before. (Students who have not may want to look

### CS 301 Course Information

CS 301: Languages and Automata January 9, 2009 CS 301 Course Information Prof. Robert H. Sloan Handout 1 Lecture: Tuesday Thursday, 2:00 3:15, LC A5 Weekly Problem Session: Wednesday, 4:00 4:50 p.m., LC

### Master s Thesis. One-Pass Strategies for Context-Free Games. Christian Cöster August 2015

Master s Thesis One-Pass Strategies for Context-Free Games Christian Cöster August 2015 Examiners: Prof. Dr. Thomas Schwentick Prof. Dr. Christoph Buchheim Technische Universität Dortmund Fakultät für

### CHAPTER 7 GENERAL PROOF SYSTEMS

CHAPTER 7 GENERAL PROOF SYSTEMS 1 Introduction Proof systems are built to prove statements. They can be thought as an inference machine with special statements, called provable statements, or sometimes

### 6.080 / 6.089 Great Ideas in Theoretical Computer Science Spring 2008

MIT OpenCourseWare http://ocw.mit.edu 6.080 / 6.089 Great Ideas in Theoretical Computer Science Spring 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.

### 6.3 Conditional Probability and Independence

222 CHAPTER 6. PROBABILITY 6.3 Conditional Probability and Independence Conditional Probability Two cubical dice each have a triangle painted on one side, a circle painted on two sides and a square painted

### Markov Algorithm. CHEN Yuanmi December 18, 2007

Markov Algorithm CHEN Yuanmi December 18, 2007 1 Abstract Markov Algorithm can be understood as a priority string rewriting system. In this short paper we give the definition of Markov algorithm and also

### On line construction of suffix trees 1

(To appear in ALGORITHMICA) On line construction of suffix trees 1 Esko Ukkonen Department of Computer Science, University of Helsinki, P. O. Box 26 (Teollisuuskatu 23), FIN 00014 University of Helsinki,

### Hint 1. Answer (b) first. Make the set as simple as possible and try to generalize the phenomena it exhibits. [Caution: the next hint is an answer to

Problem. Consider the collection of all subsets A of the topological space X. The operations of osure A Ā and ementation A X A are functions from this collection to itself. (a) Show that starting with

### 3. Mathematical Induction

3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)

### Testing LTL Formula Translation into Büchi Automata

Testing LTL Formula Translation into Büchi Automata Heikki Tauriainen and Keijo Heljanko Helsinki University of Technology, Laboratory for Theoretical Computer Science, P. O. Box 5400, FIN-02015 HUT, Finland

### CPSC 121: Models of Computation Assignment #4, due Wednesday, July 22nd, 2009 at 14:00

CPSC 2: Models of Computation ssignment #4, due Wednesday, July 22nd, 29 at 4: Submission Instructions Type or write your assignment on clean sheets of paper with question numbers prominently labeled.

### Lecture summary for Theory of Computation

Lecture summary for Theory of Computation Sandeep Sen 1 January 8, 2015 1 Department of Computer Science and Engineering, IIT Delhi, New Delhi 110016, India. E- mail:ssen@cse.iitd.ernet.in Contents 1 The

### Lecture Note 1 Set and Probability Theory. MIT 14.30 Spring 2006 Herman Bennett

Lecture Note 1 Set and Probability Theory MIT 14.30 Spring 2006 Herman Bennett 1 Set Theory 1.1 Definitions and Theorems 1. Experiment: any action or process whose outcome is subject to uncertainty. 2.

### Reliably computing cellular automaton, in 1-sparse noise

Reliably computing cellular automaton, in 1-sparse noise Peter Gács Boston University Peter Gács (Boston University) TRG Spring 2010 1 / 23 Ths is the second one of a series of three lectures on reliable