Topic
Recursively enumerable language
About: Recursively enumerable language is a research topic. Over the lifetime, 1508 publications have been published within this topic receiving 32382 citations.
Papers published on a yearly basis
Papers
More filters
Dissertation•
01 Jan 1986
6 citations
01 Jan 2006
TL;DR: It is proved that the indegree of such systems (the maximal number of incoming synapses of neurons) can be bounded by 2 without losing the computational completeness.
Abstract: We continue the search of normal forms for spiking neural P systems, and we prove that the indegree of such systems (the maximal number of incoming synapses of neurons) can be bounded by 2 without losing the computational completeness.
6 citations
TL;DR: Basic language-theoretic properties of these sets including the star event property, commutativity and hardest sets are investigated, and a complete classification of the generalized equality sets according to the numbers of homomorphisms that are used forwards or backwards is provided.
6 citations
08 Oct 1998
TL;DR: The learning model considered is an extension of Gold's inductive inference, and it is shown that every recursively enumerable class of recursive real-valued functions on a fixed rational interval is consistently inferable in the limit.
Abstract: In this paper we investigate the inductive inference of recursive real-valued functions from data. A recursive real-valued function is regarded as a computable interval mapping. The learning model we consider in this paper is an extension of Gold's inductive inference. We first introduce some criteria for successful inductive inference of recursive real-valued functions. Then we show a recursively enumerable class of recursive real-valued functions which is not inferable in the limit. This should be an interesting contrast to the result by Wiehagen (1976, Elektronische Informationsverarbeitung und Kybernetik, Vol. 12, pp. 93--99) that every recursively enumerable subset of recursive functions from N to N is consistently inferable in the limit. We also show that every recursively enumerable class of recursive real-valued functions on a fixed rational interval is consistently inferable in the limit. Furthermore, we show that our consistent inductive inference coincides with the ordinary inductive inference, when we deal with recursive real-valued functions on a fixed closed rational interval. Copyright 2001 Elsevier Science B.V. All rights reserved.
6 citations
25 Sep 2005
TL;DR: It is proved that each recursively enumerable tree language can be obtained by this P systems with membrane creation working with symbol objects.
Abstract: In this paper, we consider P systems with membrane creation working with symbol objects. As a result of a halting computation we do not take the set of numbers generated in a designated output membrane, instead we take the resulting tree representing the membrane structure of the final configuration. We prove that each recursively enumerable tree language can be obtained by this system.
6 citations