1. A method for transforming at least one-data structure specifying at least one tree structure in a computing system to at least one modular finite state transducer (MFST), comprising: receiving at least one data structure onto a memory unit configured to include either ordered, unordered, or unordered and ordered information specifying at least one tree structure representing at least one finite state transducer (FST) including semantics for defining ordered and unordered information; and for any type of finite state machine (FSM) model represented by the at least one data structure, transforming the at least one data structure to at least one MFST while preserving the ordered and unordered information of the at least one data structure in the at least one MFST, wherein said transforming includes performing any of an intersection, union and complement operation, or performing any transformation operation that is reducible to any of an intersection, union and complement operation, on the at least one data structure, wherein it is determinable whether the resulting MFST accepts a non-empty input.
1. A method for transforming at least one-data structure specifying at least one tree structure in a computing system to at least one modular finite state transducer (MFST), comprising: receiving at least one data structure onto a memory unit configured to include either ordered, unordered, or unordered and ordered information specifying at least one tree structure representing at least one finite state transducer (FST) including semantics for defining ordered and unordered information; and for any type of finite state machine (FSM) model represented by the at least one data structure, transforming the at least one data structure to at least one MFST while preserving the ordered and unordered information of the at least one data structure in the at least one MFST, wherein said transforming includes performing any of an intersection, union and complement operation, or performing any transformation operation that is reducible to any of an intersection, union and complement operation, on the at least one data structure, wherein it is determinable whether the resulting MFST accepts a non-empty input. 3. The method of claim 1 , wherein said transforming includes performing at least one control flow analysis algorithm on the FSTs represented by at least one data structure that preserves the ordered and unordered semantics information of the at least one data structure for any type of representation.