Algorithm Build-Atm(Pos, dsucSet)
Input: : the initial state of the Atm
   tabSet: the set of successor tables for T drawn from
Output: Atm: a Atm of T for MLCS
(1)  Atm = NULL,
(2)  Build-Atm( , tabSet)
(3)  dispatch map functions in parallel do
(4)    for each , for dispatch a Map function
(5)    
(6)     if and
(7)      
(8)    end for
(9)  reduce all the results of the Map functions
(10) reduce all the results of the Map functions
(11) Build-Atm( , tabSet)
(12) return Atm
(13) end
Algorithm 2: The pseudocode for constructing Atm in parallel by MapReduce.