On restricted one-counter machines |
| |
Authors: | Oscar H. Ibarra Louis E. Rosier |
| |
Affiliation: | (1) Computer Science Department, Institute of Technology, University of Minnesota, 136 Lind Hall, 55455 Minneapolis, MN, USA |
| |
Abstract: | Let be the class of real-time nondeterministic one-counter machines whose counters make at mostone reversal. Let 1 (respectively, 2) be the subclass consisting of machines whose only nondeterministic move is in the choice of when to reverse the counter (respectively, when to start using the counter). 1 and 2 are among the simplest known classes of machines for which the universe problem has been shown undecidable. (The universe problem for a class of machines is the problem of deciding if an arbitrary machine in the class accepts all its inputs.) Here, we show that the classes of languages accepted by machines in 1 and 2 are incomparable. Moreover, the union of the language classes is properly contained in the class defined by . We also, briefly, look at the closure properties of these machines.This research was supported in part by NSF Grant MCS78-01736. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|