Abstract
We analyze models of infinite-state automata extended by monotonic counting mechanisms, starting from the (finite-state) Parikh automata studied by Klaedtke and Rueß. We show that, for linear-bounded automata, this extension does not increase the language recognition power. In the framework of infinite transition systems developed by Caucal and others, we show that adding monotonic counters to synchronized rational graphs still results in synchronized rational graphs, in contrast to the case of pushdown graphs or prefix-recognizable graphs. For prefix-recognizable graphs, however, we show that the extension by monotonic counters retains the decidability of the reachability problem.
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
Bouajjani, P.: Habermehl: Constrained properties, semi-linear systems, and Petri nets. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol. 1119, pp. 481–497. Springer, Heidelberg (1996)
Caucal, D.: On infinite transition graphs having a decidable monadic theory. Theoretical Computer Science 290, 79–115 (2003)
Dal Zilio, S., Lugiez, D.: XML schema, tree logic and sheaves automata. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol. 2706, pp. 246–263. Springer, Heidelberg (2003)
Dang, Z., Ibarra, O.H., Bultan, T., Kemmerer, R.A., Su, J.: Binary reachability analysis of discrete pushdown timed automata. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 69–84. Springer, Heidelberg (2000)
Ginsburg, S., Spanier, E.H.: Bounded ALGOL-like languages. Transactions of the American Mathematical Society 113, 333–368 (1964)
Greibach, S.A.: Remarks on blind and partially blind one-way multicounter machines. Theoretical Computer Science 7, 311–324 (1978)
Ibarra, O.H.: Reversal-bounded multicounter machines and their decision problems. Journal of the Association for Computing Machinery 25, 116–133 (1978)
Ibarra, O.H., Bultan, T., Su, J.: Reachability analysis for some models of infinitestate transition systems. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 183–198. Springer, Heidelberg (2000)
Karianto, W.: Parikh automata with pushdown stack. Diploma thesis. RWTH Aachen, Germany (2004)
Klaedtke, F., Rueß, H.: Parikh automata and monadic second-order logics with linear cardinality constraints. Technical Report 177, Institute of Computer Science, Freiburg University, Germany (2002)
Klaedtke, F., Rueß, H.: Monadic second-order logics with cardinalities. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 681–696. Springer, Heidelberg (2003)
Leucker, M.: Prefix-recognizable graphs and monadic logic. In: Grädel, E., Thomas, W., Wilke, T. (eds.) Automata, Logics, and Infinite Games. LNCS, vol. 2500, pp. 263–283. Springer, Heidelberg (2002)
Minsky, M.L.: Recursive unsolvability of Post’s problem of ‘tag’ and other topics in theory of Turing machines. Annals of Mathematics 74, 437–455 (1961)
Parikh, R.J.: On context-free languages. Journal of the Association for Computing Machinery 13, 570–581 (1966)
Seidl, H., Schwentick, T., Muscholl, A.: Numerical document queries. In: Proc. PODS 2003, pp. 155–166. ACM Press, New York (2003)
Seidl, H., Schwentick, T., Muscholl, A., Habermehl, P.: Counting in trees for free. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 1136–1149. Springer, Heidelberg (2004)
Stirling, C.: Decidability of bisimulation equivalence for pushdown processes. Technical Report EDI-INF-RR-0005, School of Informatics, University of Edinburgh, Scotland (2000)
Thomas, W.: A short introduction to infinite automata. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds.) DLT 2001. LNCS, vol. 2295, pp. 130–144. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Karianto, W. (2005). Adding Monotonic Counters to Automata and Transition Graphs. In: De Felice, C., Restivo, A. (eds) Developments in Language Theory. DLT 2005. Lecture Notes in Computer Science, vol 3572. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11505877_27
Download citation
DOI: https://doi.org/10.1007/11505877_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26546-7
Online ISBN: 978-3-540-31682-4
eBook Packages: Computer ScienceComputer Science (R0)