About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Paper
Real-time solutions of the origin-crossing problem
Abstract
The n-dimensional origin-crossing language, On, is a language each of whose words describes a walk through n-dimensional space beginning and ending at the origin. For each n, On is real-time recognizable by an n-counter machine but not by any (n - 1)-counter machine. In contrast, for all n, On is real-time recognizable by a one-tape Turing machine. © 1968 Springer-Verlag New York Inc.