Abstract
The paper deals with nondeterministic and deterministic k-machines which represent, in a certain sense, generalizations of some well-known notions. Connections between the sets of sequences constructed by nondeterministic and deterministic k-machines, and some other related problems are investigated.
Get full access to this article
View all access options for this article.
