1. Lecture Notes in Computer Science,2005
2. Černý, J., Pirická, A., Rosenauerová, B.: On directable automata. Kybernetika 7(4), 289–298 (1971)
3. Deshmukh, R.G., Hawat, G.N.: An algorithm to determine shortest length distinguishing, homing, and synchronizing sequences for sequential machines. In: Proc. Southcon 1994 Conference, pp. 496–501 (1994)
4. Eppstein, D.: Reset sequences for monotonic automata. SIAM Journal on Computing 19(3), 500–510 (1990)
5. Fukada, A., Nakata, A., Kitamichi, J., Higashino, T., Cavalli, A.: A conformance testing method for communication protocols modeled as concurrent DFSMs. Treatment of non-observable non-determinism. In: Proc. IEEE 15th Int. Conf. on Information Networking, pp. 155–162 (2001)