Module20 - Module 20 NFA's with-transitions NFA's Formal...

Info iconThis preview shows pages 1–8. Sign up to view the full content.

View Full Document Right Arrow Icon
1 Module 20 NFA’s with λ -transitions NFA- λ ’s Formal definition Simplifies construction LNFA- λ Showing LNFA is a subset of LNFA and therefore a subset of LFSA
Background image of page 1

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

View Full Document Right Arrow Icon
2 Defining NFA- λ ’s
Background image of page 2
3 Change: λ -transitions We now allow an NFA M to change state without reading input That is, we add the following categories of transitions to δ δ (q ,λ29 is allowed
Background image of page 3

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

View Full Document Right Arrow Icon
4 Example * a,b a a,b a b a b a,b a,b a a b λ λ
Background image of page 4
5 Defining L(M) and LNFA- λ M accepts string x if one of the configurations reached is an accepting configuration – (q 0 , x) |- * (f, λ ) where f in A M rejects string x if all configurations reached are either not halting configurations or are rejecting configurations L(M) or Y(M) N(M) LNFA- λ Language L is in language class LNFA- λ iff
Background image of page 5

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

View Full Document Right Arrow Icon
6 LNFA- λ subset LFSA Recap of what we already know Let M be any NFA – There exists an algorithm A 1 which constructs an FSA M’ such that L(M’) = L(M) New goal Let M be any NFA- λ – There exists an algorithm A 2 which constructs an FSA M’ such that L(M’) = L(M)
Background image of page 6
7 Visualization Goal Let M be any NFA- λ – There exists an algorithm A 2 which constructs an FSA M’ such that L(M’) = L(M) NFA- λ M FSA M’ A 2
Background image of page 7

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

View Full Document Right Arrow Icon
Image of page 8
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Page1 / 19

Module20 - Module 20 NFA's with-transitions NFA's Formal...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online