Solution Prove by induction the following statement If

Solution Prove by induction the following statement: • If there is an edge connecting every pair of nodes in a graph G and n is the number of nodes in G, then the number of edges in G is n(n-1)/2

Finite Automata (Deterministic) (Chapter 1) Note: once again you are strongly advised to read the covered chapters from the book carefully. Particularly the examples!

Reminder: Functions vs Relations Let P = {p: p is a person} M = {m: m is a male} S 1 = {(m, p): m is in M, p is in P and m is the father of p} S 2 = {(m, p): m is in M, p is in P and m is an ancestor of p} 1. 2. 3. 4. True or false: S 1 M P True or false: S 2 M P Is either S 1 or S 2 a relation in M P? Is either S 1 or S 2 a function f: M P?

You have seen Finite Automata before! 1. Write a program that indicates if a given input text contains the string “Britney Spears” (or “Justin Timberlake”) 2. Check this video:

NPC’s Behavior is Modeled through Finite State Machines (I) • State: an activity performed by an avatar • Event: something that happens in the game world that makes state change Enemy on sight Patrol Attack

NPC’s Behavior is Modeled through Finite State Machines (II) Attack ~E E D E S Wander E ~E D Spawn ~S Chase D S • States – Attack – Chase – Spawn – Wander • Events – E: see an enemy – S: hear a sound – D: die

Deterministic Automata (Informal) Key questions: if a automaton is confronted with a certain state where a choice must be made, 1. are all the alternatives transitions known? , and 2. given some input data, is it known which transition the machine will make? “new state” “current state” “transition” If the answer to both of these questions is “yes”, the automaton is said to be deterministic

Nondeterministic Automata (Informal) If the answer to any of these questions is “no”, the automaton is said to be nondeterministic That is, either • some transitions are unknown, or • given some input data, the machine can make more than one transition

Deterministic Automata (Informal) of the computation We are going to define automata indicating for a state s and some input data d, which is the state that will be reached d s’ s Transition: ((s, d), s’) Let Q be the set of all states and be the set of all input data. Then, the set of transitions is a subset of (Q ) Q

Determinism, Nondeterminism, Relations and Functions The set of transitions defining an automaton is a subset of (Q ) Q If the automaton is deterministic, should the set of transitions be a relation or a function? • Deterministic automata: Since for each pair (s, d) there should be one and only one s’, the set of transitions must be a function • Nondeterministic automata: Since for each pair (s, d) there might not be any s’ or there might be more than one s’, the set of transitions must be a relation

Finite Automata • Problem 1: Design a computer program that given a sequence of numbers a 1, a 2, …, an returns their sum a 1 + a 2 +… + an • Problem 2: Design a computer program that given a sequence of numbers a 1, a 2, …, an returns the list in the inverted order: an, …, a 2, a 1 • How many memory units are needed for a program to execute: Ø problem 1: 1 ØProblem 2: n Finite automata use a constant amount of memory

Deterministic Finite Automaton (finite automaton) A deterministic finite automaton (DFA) or finite automaton is a 5 -tuple (Q, , , s, F) where: • Q is a finite set of elements called states • is a finite input alphabet • is a transition function, (Q × ) × Q (or : (Q × ) Q) • s Q called the start state As in yes! (or no!) • F Q called the favorable states The input word is no! (or yes!) (not) in the language Constant! recognized by the automaton a 1 a 2 … The fact that is a function makes the automaton deterministic

Finite State Diagram • A finite state diagram is a graphic representation for a finite automaton • A finite state diagram is a directed graph, where nodes represent elements in Q (i. e. , states) and arrows are characters in such that: q a q’ Indicates: ((q, a), q’) is a transition in The start state is marked with: > The favorable states are marked with:

Example # 1 a, b b > s b a q a r Formally, this automaton (Q, , , s, F) is defined as: : 6 transitions: Q = {s, q, r} Is this automaton • ((s, b), s) deterministic? • ((s, a), q) = {a, b} • ((q, a), r) s: start state • ((q, b), s) F = {r} • ((r, a), r) • ((r, b), r)

Kleene Star • Given a set B of characters, B* denote the set of all strings made of elements in B. • Typically we take * for all words that can be given as input for a DFA (Q, , , s, F) • If = {0, 1}, what is *? • If = {a, b, c, …, z}, what is *? the empty word, e, is always in *

Formal Definition of Computation • Given an finite automaton M= (Q, , , s, F), and let w = w 1 w 2 …wn, where each wi is in (i. e. , w in *) M accepts w if there is a sequence of states r 0 , r 1, r 2 , … rn in Q such that: 1. r 0 is the start state of M 2. (ri , wi+1) = ri+1 “such that” 3. rn in F • Language recognized by M: {w in * : M accepts w} • Given a language A, with A *, the language A is regular if a finite automata exists recognizing A

Example a b > s b a q a r b 1. Is abb accepted by this automaton? 2. Is abba accepted by this automaton? 3. What is the language recognized by this automaton?

Example # 2 a b > s b a q a r b What is the language recognized by this automaton?

Homework Friday Sept. 7 • 1. 6: a, f, j • 1. 31 • 1. 36

Sample Problems 1. 6: b Let = {0, 1}, Show that the following language over is regular: {w : w contains at least three 1’s} 1. 31 Let A be a regular language. Show that: AR = {w. R | w is in A} is also regular