A. V. Aho, J. D. Ullman, and M. Yannakakis, On notions of information transfer in VLSI circuits, Proceedings of the fifteenth annual ACM symposium on Theory of computing , STOC '83, pp.133-139, 1983.
DOI : 10.1145/800061.808742

J. Hromkovi?, J. Karhumäki, H. Klauck, and G. Schnitger, Communication Complexity Method for Measuring Nondeterminism in Finite Automata, Information and Computation, vol.172, issue.2, pp.202-217, 2002.
DOI : 10.1006/inco.2001.3069

J. Hromkovi? and G. Schnitger, Nondeterministic Communication with a Limited Number of Advice Bits, SIAM Journal on Computing, vol.33, issue.1, pp.43-68, 2003.
DOI : 10.1137/S0097539702414622

H. Leung, Separating exponentially ambiguous finite automata from polynomially ambiguous finite automata, SIAM, J. Comput, vol.27, pp.1073-1082, 1998.
DOI : 10.1137/s0097539793252092
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.7.667

L. Lovasz, Communication complexity: a survey, in " Paths, Flows and VLSI Layout, pp.235-266, 1990.

B. Ravikumar and O. Ibarra, Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation, SIAM Journal on Computing, vol.18, issue.6, pp.1263-1282, 1989.
DOI : 10.1137/0218083

R. E. Stearns and H. B. , On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata, SIAM Journal on Computing, vol.14, issue.3, pp.598-611, 1985.
DOI : 10.1137/0214044

A. Weber and H. Seidl, On the degree of ambiguity of finite automata, Theoretical Computer Science, vol.88, issue.2, pp.325-349, 1991.
DOI : 10.1016/0304-3975(91)90381-B