Polynomial-Space Decidable Membership Problems for Recurrent Systems over Sets of Natural Numbers

Abstract

A finite recurrent system over sets of natural numbers of dimension n is a pair composed of n n-ary functions over sets of natural numbers and an n-tuple of singleton sets of natural numbers. Every function is applied to the entries of the tuple and computes a set of natural numbers, that may also be empty. The results are composed into another tuple, and… (More)
DOI: 10.1007/s00224-007-2034-7

8 Figures and Tables

Topics

  • Presentations referencing similar topics