Abstract
A finite recurrent system over the power set of the natural numbers of dimension n is a pair composed of nn-ary functions over the power set of the natural numbers and an n-tuple of singleton sets of naturals. Every function is applied to the components of the tuple and computes a set of natural numbers, that might also be empty. The results are composed into another tuple, and the process is restarted. Thus, a finite recurrent system generates an infinite sequence of n-tuples of sets of natural numbers. The last component of a generated n-tuple is the output of one step, and the union of all outputs is the set defined by the system. We will consider only special finite recurrent systems: functions are built from the set operations union (∪), intersection (∩) and complementation (–) and the arithmetic operations addition (⊕) and multiplication (⊗). Sum and product of two sets of natural numbers are defined elementwise. We will study two types of membership problems: given a finite recurrent system and a natural number, does the set defined by the system contain the queried number, and does the output of a specified step contain the queried number? We will determine upper and lower bounds for such problems where we restrict the allowed operations to subsets of { ∩ , ∪ , − − , ⊕ , ⊗ }. We will show completeness results for the complexity classes NL, NP and PSPACE.
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
Glaßer, C.: Private communication (2003)
McKenzie, P., Wagner, K.W.: The Complexity of Membership Problems for Circuits over Sets of Natural Numbers. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 571–582. Springer, Heidelberg (2003)
Meister, D.: The complexity of problems concerning matrix powers and the numbers of paths in a graph, manuscript
Meister, D.: Membership problems for recurrent systems over the power set of the natural numbers, Technical report 336, Institut für Informatik, Bayerische Julius-Maximilians-Universität Würzburg (2004)
Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)
Savitch, W.J.: Relationships Between Nondeterministic and Deterministic Tape Complexities. Journal of Computer and System Sciences 4, 177–192 (1970)
Stockmeyer, L.J., Meyer, A.R.: Word Problems Requiring Exponential Time. In: Proceedings of the ACM Symposium on the Theory of Computation, pp. 1–9 (1973)
Vollmer, H.: Introduction to Circuit Complexity. Springer, Heidelberg (1999)
Wagner, K.: The Complexity of Problems Concerning Graphs with Regularities. In: Chytil, M.P., Koubek, V. (eds.) MFCS 1984. LNCS, vol. 176, pp. 544–552. Springer, Heidelberg (1984)
Wagner, K.W.: The Complexity of Combinatorial Problems with Succinct Input Representation. Acta Informatica 23, 325–356 (1986)
Yang, K.: Integer Circuit Evaluation Is PSPACE -Complete. Journal of Computer and System Sciences 63, 288–303 (2001)
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
Meister, D. (2005). Decidable Membership Problems for Finite Recurrent Systems over Sets of Naturals. In: Liśkiewicz, M., Reischuk, R. (eds) Fundamentals of Computation Theory. FCT 2005. Lecture Notes in Computer Science, vol 3623. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11537311_8
Download citation
DOI: https://doi.org/10.1007/11537311_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28193-1
Online ISBN: 978-3-540-31873-6
eBook Packages: Computer ScienceComputer Science (R0)