Next:
Alternative notational models for
Up:
Formalisms
Previous:
Finite State Automata
Example of DFSA
Take the following FSA:
Q
=
home
Q
=
F
Q
= { CAFE }
=
<
HOME
,
highstreet
,
BANK
>,
<
HOME
,
elmroad
,
CHURCH
>,
<
BANK
,
parkavenue
,
CAFE
>,
<
CHURCH
,
oaklane
,
CAFE
>,
<
CAFE
,
millcrescent
,
BANK
>
How many routes can you define with this FSA?
Design an FSA for your home, office area, ...
Dafydd Gibbon
Fri Nov 28 02:24:58 MET 1997