1. Abdulla, P.A., Čerāns, K., Jonsson, B., Tsay, Y.K.: Algorithmic analysis of programs with well quasi-ordered domains. Inform. and Comput. 160(1/2), 109–127 (2000)
2. Lecture Notes in Computer Science;M Blondin,2014
3. Bonnet, R., Finkel, A., Praveen, M.: Extending the Rackoff technique to affine nets. FSTTCS 2012. LIPIcs, vol. 18, pp. 301–312. LZI (2012)
4. Bonnet, R.: On the cardinality of the set of initial intervals of a partially ordered set. Infinite and finite sets: to Paul Erdős on his 60th birthday, vol. 1, pp. 189–198. Coll. Math. Soc. János Bolyai, North-Holland (1975)
5. Lecture Notes in Computer Science;L Bozzelli,2011