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
28 citations
TL;DR: It is shown that such systems with one-symbol context-free insertion and deletion rules are able to generate Parikh sets of all recursively enumerable languages (PsRE), and that the priority relation is very important.
27 citations
01 Jan 2012
TL;DR: In this article, it has been shown that finite axiomatic extensions of Lambek Calculus with finitely many nonlogical axioms are decidable in polynomial time.
Abstract: We study Nonassociative Lambek Calculus and Associative Lambek Calculus enriched with finitely many nonlogical axioms. We prove that the nonassociative systems are decidable in polynomial time and generate context-free languages. In [Buszkowski 1982] it has been shown that finite axiomatic extensions of Associative Lambek Calculus generate all recursively enumerable languages; here we give a new proof of this fact. We also obtain similar results for systems with permutation and n−ary
27 citations
Journal Article•
TL;DR: A geometric model of computation, conservative abstract geometrical computation, that, although being based on rational numbers, has the same property: it can simulate any Turing machine and can decide any R.E. problem through the creation of an accumulation.
Abstract: The Black hole model of computation provides super-Turing computing power since it offers the possibility to decide in finite (observer's) time any recursively enumerable (R.E.) problem. In this paper, we provide a geometric model of computation, conservative abstract geometrical computation, that, although being based on rational numbers (and not real numbers), has the same property: it can simulate any Turing machine and can decide any R.E. problem through the creation of an accumulation. Finitely many signals can leave any accumulation, and it can be known whether anything leaves. This corresponds to a black hole effect.
27 citations
01 Jan 2009
TL;DR: In this paper, the authors considered insertion-deletion P systems with priority of deletion over insertion and showed that such systems with one-symbol context-free insertion and deletion rules are able to generate Parikh sets of all recursively enumerable languages (PsRE).
Abstract: In this paper, we consider insertion-deletion P systems with priority of deletion over insertion. We show that such systems with one-symbol context-free insertion and deletion rules are able to generate Parikh sets of all recursively enumerable languages (PsRE). If a one-symbol one-sided context is added to the insertion or deletion rules, then all recursively enumerable languages can be generated. The same result holds if a deletion of two symbols is permitted. We also show that the priority relation is very important, and in its absence the corresponding class of P systems is strictly included in the family of matrix languages (MAT).
27 citations