lecture7

# 2 3 4 5 set of states q sxy must be a nite set

This preview shows page 1. Sign up to view the full content.

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

Unformatted text preview:   L = { a+b+ } can be also be generated by the following FSA a s determinis6c FSA (DFSA) no ambiguity about where to go at any given state i.e. for each input symbol in the alphabet at any given state, there is a unique “acNon” to take non ­determinis6c FSA (NDFSA) x a y > b b no restric7on on ambiguity (surprisingly, no increase in power) Finite State Automata (FSA) •  more formally –  (Q,s,f,Σ,δ) 1.  2.  3.  4.  5.  set of states (Q): {s,x,y} must be a ﬁnite set start state (s): s end state(s) (f): y > alphabet (Σ): {a, b} transiNon funcNon δ: signature: character × state → state •  •  •  •  δ(a,s)=x δ(a,x)=x δ(b,x)=y δ(b,y)=y s a x a b y b Finite State Automata (FSA) •  In Perl We can simulate our 2D transiNon table using a hash transiNon funcNon δ: whose elements are...
View Full Document

## This note was uploaded on 04/29/2012 for the course LING 438 taught by Professor Fong during the Fall '11 term at Arizona.

Ask a homework question - tutors are online