next up previous contents
Next: Finite State Transducers Up: Formalisms Previous: Alternative notational models for

Translation from FSA to RG

There is a simple set of rules for translating an automaton into a rule grammar:

  1. Create a nonterminal symbol for each member of Q.
  2. Create a terminal symbol for each member of tex2html_wrap_inline1422
  3. Create a rule for each member of tex2html_wrap_inline1604 by writing the first member of Q, then tex2html_wrap_inline1466, then the second member of Q.
  4. Edit the rules to remove rightmost final symbols.

Thus:

FSA Regular grammar
tex2html_wrap_inline1532 tex2html_wrap_inline1580
<HOME, highstreet, BANK>, tex2html_wrap_inline1618
<HOME, elmroad, CHURCH>, tex2html_wrap_inline1622
<BANK, parkavenue, CAFE>, tex2html_wrap_inline1626
<CHURCH, oaklane, CAFE>, tex2html_wrap_inline1630
<CAFE, millcrescent,BANK> tex2html_wrap_inline1634
tex2html_wrap_inline1592

Note on upper and lower case:

It is standard practice to capitalise the names of states and non-terminal symbols.



Dafydd Gibbon
Fri Nov 28 02:24:58 MET 1997