C. Papazian and E. Rémila, Graph Automata Recognition, 1999.

C. Papazian and E. Rémila, Linear Time Recognizer for Subsets of Z 2 , Proceedings of Fundamentals of Computation Theory, pp.400-403, 2001.

C. Papazian and E. Rémila, Hyperbolic Recognition by Graph Automata International Colloquium on Automata, Languages and Programming, vol.2380, pp.330-342, 2002.

J. Mazoyer, C. Nichitiu, and E. Rémila, Compass permits leader election, Proceeding of SODA, pp.948-949, 1999.

E. Rémila, Recognition of graphs by automata, Theoretical Computer Science TCS, vol.136, pp.291-332, 1994.

E. Rémila, An introduction to automata on graphs, Mathematics and Its Applications, vol.460, pp.345-352, 1999.

P. , Existence d'automates finis capables de s'accorder bien qu'arbitrairement connectés et nombreux, Internat. Comp. Centre, vol.5, pp.245-261, 1966.

P. Rosensthiel, J. Fiksel, and A. Holliger, Intelligent graphs: Networks of finite automata capable of solving graph problems , R. C. Reed, Graph Theory and computing, pp.210-265, 1973.

A. Wu and A. Rosenfeld, Cellular graph automata I, Information and Control 42, pp.305-329, 1979.

A. Wu and A. Rosenfeld, Cellular graph automata II, Information and Control, vol.42, pp.330-353, 1979.