12. A transformation framework for transducing directed graph data structures representing finite state transducers (FSTs) to a modular finite state transducer (MFST) in a computing system, comprising: means for storing a plurality of directed graph data structures of varying types for representing FSTs in a computing system including action semantics information of the plurality of directed graph data structures; and means for employing a transducer that analyzes the plurality of directed graph data structures based on a pre-defined tree grammar and transduces the plurality of directed graph data structures to at least one MFST while preserving action semantics information of the plurality of directed graph data structures, wherein the transducer performs any of intersect, complement and union operations, or performs any transformations that are reducible to any of intersection, union and complement operations, on the plurality of directed graph data structures, wherein it is determinable whether the resulting MFST accepts a non-empty input.
12. A transformation framework for transducing directed graph data structures representing finite state transducers (FSTs) to a modular finite state transducer (MFST) in a computing system, comprising: means for storing a plurality of directed graph data structures of varying types for representing FSTs in a computing system including action semantics information of the plurality of directed graph data structures; and means for employing a transducer that analyzes the plurality of directed graph data structures based on a pre-defined tree grammar and transduces the plurality of directed graph data structures to at least one MFST while preserving action semantics information of the plurality of directed graph data structures, wherein the transducer performs any of intersect, complement and union operations, or performs any transformations that are reducible to any of intersection, union and complement operations, on the plurality of directed graph data structures, wherein it is determinable whether the resulting MFST accepts a non-empty input. 13. The transformation framework of claim 12 , wherein said transducer performs at least one control flow analysis algorithm on the FSTs represented by the plurality of directed graph data structures that preserves the action semantics information of the plurality of directed graph data structures across any type of directed graph representation.