1. P. Berman, A. Lingas, On the complexity of regular languages in terms of finite automata, Technical Report 304, Polish Academy of Sciences, 1977.
2. State-complexity of finite-state devices, state compressibility and incompressibility;Birget;Math. Systems Theory,1993
3. On the computational capacity of parallel communicating finite automata;Bordihn,2008
4. On communicating finite-state machines;Brand;J. ACM,1983
5. Multiprocessor automata;Buda;Inform. Process. Lett.,1987