slide1
Download
Skip this Video
Download Presentation
CSC 3130: Automata theory and formal languages

Loading in 2 Seconds...

play fullscreen
1 / 19

CSC 3130: Automata theory and formal languages - PowerPoint PPT Presentation


  • 95 Views
  • Uploaded on

Fall 2008. The Chinese University of Hong Kong. CSC 3130: Automata theory and formal languages. Nondeterminism. Andrej Bogdanov http://www.cse.cuhk.edu.hk/~andrejb/csc3130. Example from last time. Construct a DFA over alphabet {0, 1} that accepts those strings that end in 101

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about ' CSC 3130: Automata theory and formal languages' - kirby-terrell


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
slide1
Fall 2008

The Chinese University of Hong Kong

CSC 3130: Automata theory and formal languages

Nondeterminism

Andrej Bogdanov

http://www.cse.cuhk.edu.hk/~andrejb/csc3130

example from last time
Example from last time
  • Construct a DFA over alphabet {0, 1} that accepts those strings that end in 101
  • Sketch of answer:

0

0

q000

1

0

q00

1

q001

q0

1

0

q01

qe

1

q101

q10

0

1

q1

1

q11

1

q111

1

would be easier if
Would be easier if…
  • Suppose we could guess when the string we are reading has only 3 symbols left
  • Then we could simply look for the sequence 101and accept if we see it

1

0

1

3 symbols left

qdie

This is not a DFA!

nondeterminism
Nondeterminism
  • Nondeterminism is the ability to make guesses, which we can later verify
  • Informal nondeterministic algorithm for language of strings that end in 101:
  • Guess if you are approaching end of input
  • If guess is yes, look for 101 and accept if you see it
  • If guess is no, read one more symbol and go to step 1
nondeterministic finite automaton
Nondeterministic finite automaton
  • This is a kind of automaton that allows you to make guesses
  • Each state can have zero, one, or more transitions out labeled by the same symbol

0, 1

1

0

1

q0

q1

q2

q3

semantics of guessing
Semantics of guessing
  • State q0 has two transitions labeled 1
  • Upon reading 1, we have the choice of staying in q0 or moving to q1

0, 1

1

0

1

q0

q1

q2

q3

semantics of guessing1
Semantics of guessing
  • State q1 has no transition labeled 1
  • Upon reading 1 in q1, we die; upon reading 0, we continue to q2

0, 1

1

0

1

q0

q1

q2

q3

semantics of guessing2
Semantics of guessing
  • State q3 has no transition going out
  • Upon reading anything in q3, we die

0, 1

1

0

1

q0

q1

q2

q3

meaning of automaton
Meaning of automaton

Guess if you are 3 symbols away from end of input

0, 1

1

0

1

q0

q1

q2

q3

If so, guess you will see thepattern101

Check that you are at the end of input

formal definition
Formal definition
  • A nondeterministic finite automaton (NFA) is a 5-tuple (Q, S, d, q0, F) where
    • Q is a finite set of states
    • S is an alphabet
    • d: Q×S → subsets of Q is a transition function
    • q0ÎQ is the initial state
    • F ÍQ is a set of accepting states (or final states).
  • Only difference from DFA is that output of d is a set of states
example
Example

0, 1

1

0

1

q0

q1

q2

q3

transition function d:

alphabet S= {0, 1}

start stateQ = {q0, q1, q2, q3}

initial stateq0

accepting statesF = {q3}

inputs

0

1

q0

{q0, q1}

{q0}

q1

{q2}

Æ

states

q2

Æ

{q3}

q3

Æ

Æ

language of an nfa
Language of an NFA
  • Example
    • 1101 is accepted, but 0110 is not

The language of an NFA is the set of all strings forwhich there is some path that, starting from the initial state, leads to an accepting state as the string is read left to right.

0, 1

1

0

1

q0

q1

q2

q3

nfas are as powerful as dfas
NFAs are as powerful as DFAs
  • Obviously, an NFA can do everything a DFA can do
  • But can it do more?
nfas are as powerful as dfas1
NFAs are as powerful as DFAs
  • Obviously, an NFA can do everything a DFA can do
  • But can it do more?
  • Theorem

NO!

A language L is accepted by some DFA if and

only if it is accepted by some NFA.

proof of theorem
Proof of theorem
  • To prove the theorem, we have to show that for every NFA there is a DFA that accepts the same language
  • We will give a general method for simulating any NFA by a DFA
  • Let’s do an example first
simulation example
Simulation example

0, 1

1

0

NFA:

q0

q1

q2

0

0

0

1

q0 or q1

q0 or q2

DFA:

q0

1

1

proof of correctness
Proof of correctness
  • Lemma
  • Proof by induction on n
  • At the end, the DFA accepts iff it is in a state that contains some accepting state of NFA
  • By lemma, this is true iff the NFA can reach an accepting state

After reading n symbols, the DFA is in state {qi1,…,qik}if and only if the NFA is in one of the states qi1,…,qik

exercises
Exercises
  • Construct NFAs for the following languages over the alphabet {a, b, …, z}:
    • All strings that contain eatorseaoreasy
    • All strings that contain bothseaandtea
    • All strings that do not containfool
ad