 # Non-Deterministic Finite Automata

## Presentation on theme: "Non-Deterministic Finite Automata"— Presentation transcript:

Non-Deterministic Finite Automata

HM2 samples Question ID 74: Examine the following DFA: 1.
1.   Question ID 74: Examine the following DFA:                                                                      Identify in the list below the string that this automaton accepts. Details 2.   Question ID 75: The finite automaton below: accepts no word of length zero, no word of length one, and only two words of length two (01 and 10). There is a fairly simple recurrence equation for the number N(k) of words of length k that this automaton accepts. Discover this recurrence and demonstrate your understanding by identifying the correct value of N(k) for some particular k. Note: the recurrence does not have an easy-to-use closed form, so you will have to compute the first few values by hand. You do not have to compute N(k) for any k greater than 14.

HM2 Samples Question ID 77: Which automata define the same language?
4.   Question ID 77: Which automata define the same language?                                                                                                                                                        Note: (b) and (d) use transitions on strings. You may assume that there are nonaccepting intermediate states, not shown, that are in the middle of these transitions, or just accept the extension to the conventional finite automaton that allows strings on transitions and, like the conventional FA accepts strings that are the concatenation of labels along any path from the start state to an accepting state. Details 5.   Question ID 78: Convert the following nondeterministic finite automaton:                                                                           to a DFA, including the dead state, if necessary. Which of the following sets of NFA states is not a state of the DFA that is accessible from the start state of the DFA?

Formal Definition of DFA
A DFA consists of: Alphabet  A set of states Q A transition function δ : Q  Q One start state q0 One or more accepting states F  Q Language accepted by a DFA is the set of strings such that DFA ends at an accepting state Each string is c1c2…cn with ci   States are qi = δ(qi-1,ci ) for i=1…n qn is an accepting state

NFA and -NFA Nondeterministic Finite Automata 
Same input may produce multiple paths Allows transition with an empty string or transition from one state to different states given a character q1 q2 1 q3 nondeterministic transition q1 q2 empty string transition

The Language Accepted by a NFA

EXAMPLE

Another Example Accept strings containing a 1 in the third position from the back 1 2 3 4 0,1 0, 1

RECAP: How does NFA work?
Start in start state Read a symbol, clone a machine for each matching transition If a symbol is read and there is no way to exit from a state, then that machine dies At end of input if any machine accepts then accept

RECAP Definition: NFA An NFA is defined by a 5-tuple, with
Alphabet  A set of states Q A transition function δ : Q Σ P(Q) One start state q0 One or more accepting states F  Q Notation: P(Q) is power set of Q What is the difference from DFA?

RECAP Nondeterministic Transition
The function δ : Q Σ P(Q) is the key difference! When reading symbol `a’ while in state q, it may go to one of the states in δ(q,a)Q. Can δ(q,a) map to empty set?

RECAP Languages Language accepted by a NFA is the set of strings such that NFA ends at an accepting state Each string of language is c1c2…cn with ciΣ (possibly with ε) States are qi  δ(qi-1,ci) for i=1…n qn is an accepting state

RECAP DFA = NFA Theorem: For every language L accepted by an NFA, there is a DFA that accepts L. In other words, DFA and NFA are equivalent computational models. Proof idea: When keeping track of nondeterministic computation of NFA N, use many ‘fingers’ to point at the set of states of N that can be reached on a given input string. We can simulate this computation with a DFA M with state space P(Q).

Proof of DNA=NFA More formal proof: Let A be the language recognized by the NFA N = (Q,Σ,δ,q0,F). Define the DFA M = (Q’,Σ,δ’,q’0,F’) by Q’ = P(Q) δ’(R,a) = { qQ | qδ(r,a) for an rR } q’0 = { q0 } F’ = {RQ’ | R contains an accept state of N} 1 2 3 4 0,1 0, 1

How does NFA work? Start in start state
If any  transitions, clone a machine for each  transition Read a symbol, clone a machine for each matching transition If a symbol is read and there is no way to exit from a state, then that machine dies At end of input if any machine accepts then accept

Example Accept strings containing either 101 or 11 as a substring 1 2
3 4 0,1 0, 

Example: Read: How would this NFA work? 1 2 3 4 0,1 0, 

Definition: εNFA An NFA is defined by a 5-tuple, with
Alphabet  A set of states Q A transition function δ : Q Σε P(Q) One start state q0 One or more accepting states F  Q Notation: Σε = Σ{ε}; P(Q) is power set of Q What is the difference from DFA?

Nondeterministic Transition
The function δ : Q Σε P(Q) is the key difference! When reading symbol `a’ while in state q, it may go to one of the states in δ(q,a)Q. ε in Σε allows empty-string transitions Can δ(q,a) map to empty set?

Languages Language accepted by a NFA is the set of strings such that NFA ends at an accepting state Each string of language is c1c2…cn with ciΣε (possibly with ε) States are qi  δ(qi-1,ci) for i=1…n qn is an accepting state

The Golden Chain εNFA  NFA  DFA REGEX

EpsilonNFA NFA  DFA

Regular Expressions