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
•
4 citations
••
TL;DR: A simple structural property is given which characterizes the r.e. sets whose (Turing) degrees are cappable, which may be viewed as a solution of Post's program, which asks for a simpleStructural property of nonrecursive r.
Abstract: We give a simple structural property which characterizes the r.e. sets whose (Turing) degrees are cappable. Since cappable degrees are incomplete, this may be viewed as a solution of Post's program, which asks for a simple structural property of nonrecursive r.e. sets which ensures incompleteness.
4 citations
••
TL;DR: The structure of the 1-degrees included in an m-degree with a maximal set together with the1-reducibility relation is characterized.
Abstract: The structure of the 1-degrees included in an m-degree with a maximal set together with the 1-reducibility relation is characterized. For this a special sublattice of the lattice of recursively enumerable sets under the set-inclusion is used.
4 citations
•
TL;DR: It is proved that six-nonterminal multi-continuous grammars characterize the family of recursively enumerable languages and formulates an open problem area closely related to this characterization.
Abstract: The present paper discusses multi-continuous grammars and their descriptional complexity with respect to the number of nonterminals. It proves that six-nonterminal multi-continuous grammars characterize the family of recursively enumerable languages. In addition, this paper formulates an open problem area closely related to this characterization.
4 citations
••
30 Jul 2009TL;DR: This paper showed that any recursively enumerable language can be generated with a non-returning parallel communicating (PC) grammar system having six context-free components, which is the best known best bound.
Abstract: Improving the previously known best bound, we show that any recursively enumerable language can be generated with a non-returning parallel communicating (PC) grammar system having six contextfree components. We also present a non-returning universal PC grammar system generating unary languages, that is, a system where not only the number of components, but also the number of productions and the number of nonterminals are limited by certain constants, and these size parameters do not depend on the generated language.
4 citations