# Module18 - Module 18 NFA's nondeterministic transition...

This preview shows pages 1–6. Sign up to view the full content.

1 Module 18 NFA’s nondeterministic transition functions computations are trees, not paths L(M) and LNFA LFSA subset of LNFA

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
2 Nondeterministic Finite State Automata NFA’s
3 Change: δ is a relation For an FSA M, δ (q,a) results in one and only one state for all states q and characters a. That is, δ is a function For an NFA M, δ (q,a) can result in a set of states That is, δ is now a relation Next step is not determined (nondeterministic)

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
4 Example NFA a a a b a,b a,b Why is this only an NFA and not an FSA? Identify as many reasons as you can.
5 Computing with NFA’s Configurations: same as they are for FSA’s Computations are different Initial configuration is identical However, there may be several next configurations or there may be none . Computation is no longer a “path” but is now a “graph” (often a tree) rooted at the initial configuration Definition of halting, accepting, and rejecting configurations is identical Definition of acceptance must be modified

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 07/25/2008 for the course CSE 460 taught by Professor Torng during the Fall '07 term at Michigan State University.

### Page1 / 14

Module18 - Module 18 NFA's nondeterministic transition...

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online