# Finite state automata fsa transitiontable s a

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: themselves (anonymized) •  •  •  •  hashes δ(a,s)=x %transitiontable = ( δ(a,x)=x s =&gt; { a = &gt; &quot;x &quot; δ(b,x)=y }, &gt; δ(b,y)=y x =&gt; { Syntac6c sugar %transiNontable = ( &quot;s&quot;, { &quot;a&quot;, &quot;x&quot;, }, &quot;x&quot;, { &quot;a&quot;, &quot;x&quot; , &quot;b&quot;, &quot;y&quot; }, &quot;y&quot;, { &quot;b&quot;, &quot;y&quot; }, ); a b ); s x =&gt; &quot;x&quot;, =&gt; &quot;y&quot; }, y =&gt; { b =&gt; &quot;y&quot; } Example: a print &quot;\$transitiontable{s}{a}\n&quot;; a b y b Finite State Automata (FSA) •  Given transiNon table encoded as a hash •  How to build a decider (Accept/Reject) in Perl? ComplicaNons: •  How about ε ­transiNons? •  MulNple end states? •  MulNple start states? •  Non ­determinisNc FSA? Finite State Automata (FSA) %transitiontable = ( s =&gt; { a = &gt; &quot;x &quot; }, x =&gt; { a =&gt; &quot;x&quot;, b =&gt; &quot;y&quot; }, y =&gt; { b =&gt; &quot;y&quot; } ); @input = @ARGV; \$...
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 University of Arizona- Tucson.

Ask a homework question - tutors are online