Abstract
We investigate the computing power of stateless multi-counter machines with reversal-bounded counters. Such a machine has m-counters and it operates on a one-way input delimited by left and right end markers. The move of the machine depends only on the symbol under the input head and the signs of the counters (zero or positive). At each step, every counter can be incremented by 1, decremented by 1 (if it is positive), or left unchanged. An input string is accepted if, when the input head is started on the left end marker with all counters zero, the machine eventually reaches the configuration where the input head is on the right end marker with all the counters again zero. Moreover, for a specified k, no counter makes more than k-reversals (i.e., alternations between increasing mode and decreasing mode) on any computation, accepting or not. We mainly focus our attention on deterministic realtime (the input head moves right at every step) machines. We show hierarchies of computing power with respect to the number of counters and reversals. It turns out that the analysis of these machines gives rise to rather interesting combinatorial questions.
This research was supported in part by NSF Grants CCF-0430945 and CCF-0524136.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Frisco, P., Ibarra, O.H.: On stateless multihead finite automata and multihead pushdown automata. In: Proceedings of 13th International Conference on Developments in Language Theory. LNCS (July 2009) (to appear)
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Series in Computer Science. Addison -Wesley, Reading (1979)
Ibarra, O.H.: Reversal-bounded multicounter machines and their decision problems. J. Assoc. for Computing Machinery 25, 116–133 (1978)
Ibarra, O.H., Eğecioğlu, Ö.: Hierarchies and characterizations of stateless multicounter machines. In: Federrath, H. (ed.) Proceedings of 15th International Computing and Combinatorics Conference (COCOON 2009). LNCS (2001) (to appear)
Ibarra, O.H., Karhumaki, J., Okhotin, A.: On stateless multihead automata: hierarchies and the emptiness problem. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol. 4957, pp. 94–105. Springer, Heidelberg (2008)
Korenjak, A.J., Hopcroft, J.E.: Simple deterministic languages. In: Proceedings of IEEE 7th Annu. Symp. on Switching and Automata Theory, pp. 36–46 (1966)
Kutrib, M., Messerschmidt, H., Otto, F.: On stateless two-pushdown automata and restarting automata. In: Pre-Proceedings of the 8th Automata and Formal Languages (May 2008)
Păun, G.: Computing with Membranes. Journal of Computer and System Sciences 61(1), 108–143 (2000) (and Turku Center for Computer Science-TUCS Report 208 ) (November 1998), http://www.tucs.fi
Păun, G.: Computing with Membranes: An Introduction. Springer, Berlin (2002)
Yang, L., Dang, Z., Ibarra, O.H.: On stateless automata and P systems. In: Pre-Proceedings of Workshop on Automata for Cellular and Molecular Computing (August 2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eğecioğlu, Ö., Ibarra, O.H. (2009). On Stateless Multicounter Machines. In: Ambos-Spies, K., Löwe, B., Merkle, W. (eds) Mathematical Theory and Computational Practice. CiE 2009. Lecture Notes in Computer Science, vol 5635. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03073-4_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-03073-4_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03072-7
Online ISBN: 978-3-642-03073-4
eBook Packages: Computer ScienceComputer Science (R0)