  
  
  [1m[4m[31mReferences[0m
  
  [33m[AHU74]  [0m[1m[31mAho,  A.  V. and Hopcroft, J. E. and Ullman, J. D. [0m, [34mThe Design
  and  Analisys  of  Computer  Algorithms[0m,  Addison-Wesley, Reading, Mass.
  (1974)
  
  [33m[DE+02] [0m[1m[31mDobkin, D. and Ellson, J. and Gansner, E. and Koutsofios, E. and
  North,  S.  and Woodhull, G. [0m, [34mGraphviz - Graph Drawing Programs[0m (2002),
  ((http://www.research.att.com/sw/tools/graphviz))
  
  [33m[HU69]  [0m[1m[31mHopcroft,  J.  E. and Ullman, J. D. [0m, [34mFormal Languages and their
  Relation to Automata[0m, Addison-Wesley, Reading, Mass. (1969)
  
  [33m[KM02] [0m[1m[31mKapovich, I. and Myasnikov, A. [0m, [34mStallings foldings and subgroups
  of free groups[0m, J. of Algebra, [34m248[0m (2002), 608--668
  
  [33m[MSW01]  [0m[1m[31mMargolis,  S.  and Sapir, M. and Weil, P. [0m, [34mClosed subgroups in
  pro-V topologies and the extension problem for inverse automata[0m, Int. J.
  of Algebra and Computation, [34m11[0m (2001), 405--445
  
  [33m[MM+95]  [0m[1m[31mMatz,  O.  and  Miller,  A. and Potthoff, A. and Thomas, W. and
  Valkema, E. [0m, [34mReport on the program AMoRe[0m (9507) (1995)
  
  
  
  -------------------------------------------------------
