SHORTEST PATHS IN THE TOWER OF HANOI GRAPH AND FINITE AUTOMATA DAN ROMIK Abstract. We present efficient algorithms for constructing a shortest path between two configurations in the Tower of Hanoi graph, and for computin

First Page		Document Content
Date: 2014-02-10 20:43:55		SHORTEST PATHS IN THE TOWER OF HANOI GRAPH AND FINITE AUTOMATA DAN ROMIK Abstract. We present efficient algorithms for constructing a shortest path between two configurations in the Tower of Hanoi graph, and for computin Add to Reading List Source URL: www.math.ucdavis.edu Download Document from Source Website File Size: 220,29 KB Share Document on Facebook