GAP (Automata) - References

Goto Chapter: | Top | 1 | 2 | 3 | 4 | 5 | 6 | A | B | Bib | C | Ind

### References

[AHU:74] Aho, A. V. and Hopcroft, J. E. and Ullman, J. D. The Design and Analisys of Computer Algorithms, Addison-Wesley, Reading, Mass., (1974)

[KoutsofiosNorth:2002] Dobkin, D. and Ellson, J. and Gansner, E. and Koutsofios, E. and North, S. and Woodhull, G. Graphviz - Graph Drawing Programs, (2002)
((http://www.research.att.com/sw/tools/graphviz))

[HU:69] Hopcroft, J. E. and Ullman, J. D. Formal Languages and their Relation to Automata, Addison-Wesley, Reading, Mass., (1969)

[KM:2002] Kapovich, I. and Myasnikov, A. Stallings foldings and subgroups of free groups, J. of Algebra, 248, (2002), p. 608--668

[MSW:2001] Margolis, S. and Sapir, M. and Weil, P. Closed subgroups in pro-V topologies and the extension problem for inverse automata, Int. J. of Algebra and Computation, 11, (2001), p. 405--445

[AMORE:95] Matz, O. and Miller, A. and Potthoff, A. and Thomas, W. and Valkema, E. Report on the program AMoRe (9507), (1995)

Top of Book | Previous Chapter | Next Chapter

Goto Chapter: | Top | 1 | 2 | 3 | 4 | 5 | 6 | A | B | Bib | C | Ind

generated by GAPDoc2HTML