1. H. Abelson, Lower Bounds on Information Transfer in Distributed Computation. Proc. 19th IEEE FOCS (1978), 151–158.
2. H.N. Adorna, Some Properties of k-Party Message Complexity. Unpublished Manuscript, RWTH-Aachen (2001).
3. H.N. Adorna, 3-Party Message Complexity is Better than 2-Party Ones for Proving Lower Bounds on the Size of Minimal Nondeterministic Finite Automaton. In: J. Dassow, D. Wotschke (eds.) Pre-Proc. 3rd Internatonal Workshop on Descriptional Complexity of Automata, Grammars and Related Structures Preprint No. 16, Uni. Magdeburg. (2001), 23–34.
4. J.E. Hopcroft, J.D. Ullman, Introduction Automata Theory, Languages and Computation. Addison-Wesley, 1979.
5. J. Hromkovič, Relation Between Chomsky Hierarchy and Communication Complexity Hierarchy Acta Math. Univ. Com., Vol 48–49 (1986), 311–317.