By Topic

Tours in Machines and Digraphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
A. K. Dewdney ; Department of Computer Science, University of Western Ontario, London, Ont., Canada. ; A. L. Szilard

A tour in a machine is a shortest input sequence taking the machine from some initial state, through all of its remaining states and back again into its initial state. A best upper bound for tour length is found for two types of machines: n-state sequential machines with unrestricted input alphabet and n-state sequential machines with a two-letter input alphabet. The problem of finding a best upper bound for length of tours in machines is restated and solved using the language of the theory of directed graphs. The solutions to the above special cases restated in this language seem obvious but require a nontrivial proof of their status as solutions.

Published in:

IEEE Transactions on Computers  (Volume:C-22 ,  Issue: 7 )