1. Lecture Notes in Computer Science;L Marais,2016
2. Stone, H.S.: Discrete Mathematical Structures and their Applications. Science Research Associates, Chicago (1973)
3. Van Zijl, L.: Nondeterminism and succinctly representable regular languages. In: Proceedings of the 2002 Annual Research Conference of the South African Institute of Computer Scientists and Information Technologists. SAICSIT 2002, Republic of South Africa, South African Institute for Computer Scientists and Information Technologists, pp. 212–223 (2002)
4. Jirásková, G., Pighizzini, G.: Optimal simulation of self-verifying automata by deterministic automata. Inf. Comput. 209(3), 528–535 (2011). Special Issue: 3rd International Conference on Language and Automata Theory and Applications (LATA 2009)
5. Lecture Notes in Computer Science;J Vuillemin,2009