Gray Codes with Constant Delay and Constant Auxiliary Space

We give the first two algorithms to enumerate all binary words of {0, 1}^ℓ (like Gray codes) while ensuring that the delay and the auxiliary space is independent from ℓ, i.e., constant time for each word, and constant memory in addition to the ℓ bits storing the current word. Our algorithms are given in two new computational models: tape machines and deque machines. We also study more restricted models, queue machines and stack machines, and show that they cannot enumerate all binary words with constant auxiliary space, even with unrestricted delay. A tape machine is a Turing machine that stores the current binary word on a single working tape of length ℓ (which never increases), using no other tape. The machine has a single head and must edit its tape to reach all possible words of {0, 1}^ℓ, and output them (in unit time, by entering special output states), with no duplicates. Hence a tape machine uses constant auxiliary space by definition (up to the head position). We construct a tape machine that achieves this task with constant delay between consecutive outputs, so that the machine implements a so-called skew-tolerant quasi-Gray code. We then construct a more involved tape machine that implements a Gray code. A deque machine stores the current binary word on a double-ended queue of length ℓ, and stores a constant-size internal state. It works as a tape machine, except that it modifies the content of the deque by performing push and pop operations on the endpoints. Hence again a deque machine uses constant auxiliary space by definition. We construct deque machines that enumerate all words of {0, 1}^ℓ with constant-delay. The main technical challenge in this model is to correctly detect when enumeration has finished.