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
TL;DR: Arbitrary Arrow Update Logic with Common Knowledge (AAULC) as mentioned in this paper is a dynamic epistemic logic with an arrow update operator, which represents a particular type of information change and quantifies over arrow updates.
Abstract: Arbitrary Arrow Update Logic with Common Knowledge (AAULC) is a dynamic epistemic logic with (i) an arrow update operator, which represents a particular type of information change and (ii) an arbitrary arrow update operator, which quantifies over arrow updates.
By encoding the execution of a Turing machine in AAULC, we show that neither the valid formulas nor the satisfiable formulas of AAULC are recursively enumerable. In particular, it follows that AAULC does not have a recursive axiomatization.
7 citations
01 Feb 1993
7 citations
TL;DR: This paper proposes a new definition of the language generated by a splicing system, motivated by both biochemical and mathematical considerations, and shows that using this new definition, finite extended H systems can generate all recursively enumerable languages.
7 citations
01 Jan 2011
TL;DR: In this article, a new variant of Accepting Networks of Evolutionary Processors is proposed, where the operations are applied at arbitrary positions to the processed words (rather than at the ends of words only) and where the filters are languages from several special classes of regular sets.
Abstract: We propose a new variant of Accepting Networks of Evolutionary Processors, in which the operations are applied at arbitrary positions to the processed words (rather than at the ends of words only) and where the filters are languages from several special classes of regular sets. More precisely, we show that the use of filters from the class of non-counting, ordered, power-separating, suffix-closed regular, union-free, definite and combinational languages is as powerful as the use of arbitrary regular languages and yields networks that can accept all the recursively enumerable languages. On the other hand, by using filters that are only finite languages, monoids, nilpotent languages, commutative regular languages, or circular regular languages, one cannot generate all recursively enumerable languages. These results seem interesting as they provide both upper and lower bounds on the classes of languages that one can use as filters in an accepting network of evolutionary processors in order to obtain a complete computational model.
7 citations
TL;DR: Simulating the matrix grammar that such systems can generate the set of lengths of recursively enumerable languages, that is, Turing universality can be achieved, indicates that the time-free working mode will not reduce the computational power of PIC-P systems, by using multiple promoters/inhibitors.
7 citations