Abstract
We investigate the computing power of stateless multi- counter machines with reversal-bounded counters. Such a machine can be deterministic, nondeterministic, realtime (the input head moves right at every step), or non-realtime. The deterministic realtime stateless multicounter machines has been studied elsewhere [1]. Here we investigate non-realtime machines in both deterministic and nondeterministic cases with respect to the number of counters and reversals. We also consider closure properties and relate the models to stateless multihead automata and show that the bounded languages accepted correspond exactly to semilinear sets.
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 to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Eğecioğlu, Ö., Ibarra, O.H.: On stateless multicounter machines. TR2009-01, Department of Computer Science, UCSB. In: Proceedings of Computability in Europe 2009 (CiE), Heidelberg, Germany (2009)
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., Karhumäki, 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); Turku Center for Computer Science-TUCS Report 208 (November 1998), 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
Ibarra, O.H., Eğecioğlu, Ö. (2009). Hierarchies and Characterizations of Stateless Multicounter Machines. In: Ngo, H.Q. (eds) Computing and Combinatorics. COCOON 2009. Lecture Notes in Computer Science, vol 5609. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02882-3_41
Download citation
DOI: https://doi.org/10.1007/978-3-642-02882-3_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02881-6
Online ISBN: 978-3-642-02882-3
eBook Packages: Computer ScienceComputer Science (R0)