1. Allauzen, C., Mohri, M.: Efficient algorithms for testing the twins property. Journal of Automata, Languages and Combinatorics 8(2), 117–144 (2003)
2. Bioch, J.: The complexity of modular decomposition of boolean functions. Discrete Applied Mathematics 149(1-3), 1–13 (2005)
3. Lecture Notes in Computer Science;B.-M. Bui Xuan,2005
4. Capelle, C., Habib, M., de Montgolfier, F.: Graph decomposition and factorizing permutations. D.M.T.C.S. 5(1), 55–70 (2002)
5. Chein, M., Habib, M., Maurer, M.C.: Partitive hypergraphs. Discrete Mathematics 37(1), 35–50 (1981)