scispace - formally typeset
Search or ask a question
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
More filters
Book ChapterDOI
01 Jan 1976
TL;DR: In this paper, the authors deal with recursively enumerable relations, i.e., the set of Godel numbers of theorems of a relation that can be expressed as a function.
Abstract: In this chapter we shall deal in some detail with the set Σ1 of relations (see 5.24). Such relations are called recursively enumerable for reasons which will shortly become clear. The study of recursively enumerable relations is one of the main branches of recursive function theory. They play a large role in logic. In fact, for most theories the set of Godel numbers of theorems is recursively enumerable. Thus many of the concepts introduced in this section will have applications in our discussion of decidable and undecidable theories in Part III. Unless otherwise stated, the functions in this chapter are unary.

8 citations

Journal ArticleDOI
TL;DR: It is shown that 2 cells are enough in order to generate all recursively enumerable sets of numbers in tissue P systems with minimal cooperation, i.e., when only 2 objects may interact.
Abstract: We investigate tissue P systems with symport/antiport with minimal cooperation, i.e., when only 2 objects may interact. We show that 2 cells are enough in order to generate all recursively enumerable sets of numbers. Moreover, constructed systems simulate register machines and have purely deterministic behavior. We also investigate systems with one cell and we show that they may generate only finite sets of numbers.

8 citations

Journal ArticleDOI
01 Apr 2011
TL;DR: It is shown that if the number of states is bounded by two, then every recursively enumerable language can be generated by a network of evolutionary processors where the filters are chosen as special regular sets.
Abstract: In this paper, we study networks of evolutionary processors where the filters are chosen as special regular sets. We consider networks where all the filters belong to a set of languages that are accepted by deterministic finite automata with a fixed number of states. We show that if the number of states is bounded by two, then every recursively enumerable language can be generated by such a network. If the number of states is bounded by one, then not all regular languages but non-context-free languages can be generated.

8 citations

Book ChapterDOI
01 Dec 2017
TL;DR: Results on the language family generated by the labelled splicing system in comparison with the language families of the Chomsky hierarchy, including recursively enumerable languages, are obtained by involving only either one or two membranes in the P systems considered.
Abstract: Labelled splicing P systems are distributed parallel computing models, where sets of strings that evolve by splicing rules are labelled. In this work, we consider labelled splicing systems with the following modifications: (i) The strings in the membranes are present in arbitrary number of copies; (ii) the rules in the regions are finite in number. Results on the language family generated by the labelled splicing system in comparison with the language families of the Chomsky hierarchy, including recursively enumerable languages, are obtained, by involving only either one or two membranes in the P systems considered.

8 citations

Network Information
Related Topics (5)
Decidability
9.9K papers, 205.1K citations
91% related
Multimodal logic
6.1K papers, 178.8K citations
86% related
Type (model theory)
38.9K papers, 670.5K citations
86% related
Dynamic logic (modal logic)
6.6K papers, 210.3K citations
86% related
Mathematical proof
13.8K papers, 374.4K citations
84% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20237
202220
202127
202022
201918
201823