Abstract
The model of deterministic input-driven multi-counter automata is introduced and studied. On such devices, the input letters uniquely determine the operations on the underlying data structure that is consisting of multiple counters. We study the computational power of the resulting language families and compare them with known language families inside the Chomsky hierarchy. In addition, it is possible to prove a proper counter hierarchy depending on the alphabet size. This means that any input alphabet induces an upper bound which depends on the alphabet size only, such that \(k+1\) counters are more powerful than k counters as long as k is less than this bound. The hierarchy interestingly collapses at the level of the bound. Furthermore, we investigate the closure properties of the language families. Finally, the undecidability of the emptiness problem is derived for input-driven two-counter automata.
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
References
Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Babai, L. (ed.) STOC 2004, pp. 202–211. ACM (2004). https://doi.org/10.1145/1007352.1007390
Bárány, V., Löding, C., Serre, O.: Regularity problems for visibly pushdown languages. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 420–431. Springer, Heidelberg (2006). https://doi.org/10.1007/11672142_34
Bensch, S., Holzer, M., Kutrib, M., Malcher, A.: Input-driven stack automata. In: Baeten, J.C.M., Ball, T., de Boer, F.S. (eds.) TCS 2012. LNCS, vol. 7604, pp. 28–42. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-33475-7_3
Böhm, S., Göller, S., Jančar, P.: Equivalence of deterministic one-counter automata is NL-complete. In: Boneh, D., Roughgarden, T., Feigenbaum, J. (eds.) STOC 2013, pp. 131–140. ACM (2013). https://doi.org/10.1145/2488608.2488626
von Braunmühl, B., Verbeek, R.: Input-driven languages are recognized in \(\log n\) space. In: Topics in the Theory of Computation, Mathematics Studies, vol. 102, pp. 1–19, North-Holland (1985). https://doi.org/10.1007/3-540-12689-9_92
Breveglieri, L., Cherubini, A., Citrini, C., Crespi-Reghizzi, S.: Multi-push-down languages and grammars. Int. J. Found. Comput. Sci. 7, 253–292 (1996). https://doi.org/10.1142/S0129054196000191
Fischer, P.C., Meyer, A.R., Rosenberg, A.L.: Counter machines and counter languages. Math. Syst. Theory 2, 265–283 (1968). https://doi.org/10.1007/BF01694011
Greibach, S.A.: Remarks on blind and partially blind one-way multicounter machines. Theor. Comput. Sci. 7, 311–324 (1978). https://doi.org/10.1016/0304-3975(78)90020-8
Hahn, M., Krebs, A., Lange, K.-J., Ludwig, M.: Visibly counter languages and the structure of \(\rm NC^{1}\). In: Italiano, G.F., Pighizzini, G., Sannella, D.T. (eds.) MFCS 2015. LNCS, vol. 9235, pp. 384–394. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-48054-0_32
Ibarra, O.H.: Reversal-bounded multicounter machines and their decision problems. J. ACM 25, 116–133 (1978). https://doi.org/10.1145/322047.322058
Ibarra, O.H.: Visibly pushdown automata and transducers with counters. Fund. Inform. 148, 291–308 (2016). https://doi.org/10.3233/FI-2016-1436
Krebs, A., Lange, K., Ludwig, M.: Visibly counter languages and constant depth circuits. In: Mayr, E.W., Ollinger, N. (eds.) STACS 2015. LIPIcs, vol. 30, pp. 594–607 (2015). https://doi.org/10.4230/LIPIcs.STACS.2015.594
Kutrib, M., Malcher, A., Mereghetti, C., Palano, B., Wendlandt, M.: Deterministic input-driven queue automata: finite turns, decidability, and closure properties. Theor. Comput. Sci. 578, 58–71 (2015)
Kutrib, M., Malcher, A., Wendlandt, M.: Tinput-driven pushdown, counter, and stack automata. Fund. Inform. 155, 59–88 (2017). https://doi.org/10.3233/FI-2017-1576
La Torre, S., Napoli, M., Parlato, G.: Scope-bounded pushdown languages. Int. J. Found. Comput. Sci. 27, 215–234 (2016)
Mehlhorn, K.: Pebbling mountain ranges and its application to DCFL-recognition. In: de Bakker, J., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol. 85, pp. 422–435. Springer, Heidelberg (1980). https://doi.org/10.1007/3-540-10003-2_89
Minsky, M.L.: Recursive unsolvability of Post’s problem of “tag” and other topics in theory of Turing machines. Ann. Math. 74, 437–455 (1961). 2nd S
Okhotin, A., Salomaa, K.: Complexity of input-driven pushdown automata. SIGACT News 45, 47–67 (2014). https://doi.org/10.1145/2636805.2636821
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Kutrib, M., Malcher, A., Wendlandt, M. (2019). Input-Driven Multi-counter Automata. In: Hospodár, M., Jirásková, G. (eds) Implementation and Application of Automata. CIAA 2019. Lecture Notes in Computer Science(), vol 11601. Springer, Cham. https://doi.org/10.1007/978-3-030-23679-3_16
Download citation
DOI: https://doi.org/10.1007/978-3-030-23679-3_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-23678-6
Online ISBN: 978-3-030-23679-3
eBook Packages: Computer ScienceComputer Science (R0)