3.3 Implementing Operations on FSAs

We discussed several properties of regular languages in the last sections, and almost all proofs we saw were conducted so as to lead directly to corresponding methods for constructing and transforming FSAs. In this section, we will implement some of these methods. We will set up a general framework for operations on FSAs. Within this framework we will give implementations for the operations of union and intersection, and leave the implementation of further ioperations to you as an exercise.



Kristina Striegnitz, Patrick Blackburn, Katrin Erk, Stephan Walter, Aljoscha Burchardt and Dimitra Tsovaltzi
Version 1.2.5 (20030212)