  
  
  [1XReferences[101X
  
  [[20XAHU74[120X]  [16XAho,  A.  V., Hopcroft, J. E. and Ullman, J. D.[116X, [17XThe Design and
  Analisys of Computer Algorithms[117X, Addison-Wesley, Reading, Mass. (1974).
  
  [[20XDEGKNW02[120X]  [16XDobkin,  D., Ellson, J., Gansner, E., Koutsofios, E., North,
  S.  and  Woodhull, G.[116X, [17XGraphviz - Graph Drawing Programs[117X, AT\&T Research
  and            Lucent            Bell            Labs            (2002),
  (((http://www.research.att.com/sw/tools/graphviz))).
  
  [[20XHU69[120X]  [16XHopcroft,  J.  E.  and Ullman, J. D.[116X, [17XFormal Languages and their
  Relation to Automata[117X, Addison-Wesley, Reading, Mass. (1969).
  
  [[20XKM02[120X]  [16XKapovich, I. and Myasnikov, A.[116X, [17XStallings foldings and subgroups
  of free groups[117X, [18XJ. of Algebra[118X, [19X248[119X (2002), 608--668.
  
  [[20XMSW01[120X]  [16XMargolis, S., Sapir, M. and Weil, P.[116X, [17XClosed subgroups in pro-V
  topologies  and  the  extension problem for inverse automata[117X, [18XInt. J. of
  Algebra and Computation[118X, [19X11[119X (2001), 405--445.
  
  [[20XMMPTV95[120X]  [16XMatz,  O.,  Miller, A., Potthoff, A., Thomas, W. and Valkema,
  E.[116X,  [17XReport  on  the program AMoRe[117X, Christian Albrechts Universit{\"a}t,
  Kiel, 9507 (1995).
  
  
  
  [32X
