Results 21 to 30 of about 3,677,609 (156)

Decomposition of recursively enumerable degrees

open access: yes, 1980
It is shown that any nonzero recursively enumerable degree can be expressed as the join of two distinct such degrees having a greatest lower bound.
A. H. Lachlan
core   +1 more source

Dyck Reductions of Minimal Linear Languages Yield the Full Class of Recursively Enumerable Languages [PDF]

open access: yesDyck Reductions of Minimal Linear Languages Yield the Full Class of Recursively Enumerable Languages
application/pdf In this paper, we give a direct proof of the result of Latteux and Turakainen that the full class of recursively enumerable languages can be obtained from minimal linear languages (which are generated by linear context-free grammars with only one nonterminal symbol) by Dyck reductions (which reduce pairs of parentheses to the empty word)
Hirose, Sadaki, Okawa, Satoshi
core   +3 more sources

Groups with a recursively enumerable irreducible word problem [PDF]

open access: yes, 2013
The notion of the word problem is of fundamental importance in group theory. The irreducible word problem is a closely related concept and has been studied in a number of situations; however there appears to be little known in the case where a finitely ...
Richard M. Thomas   +3 more
core   +1 more source

On simple generators of recursively enumerable languages

open access: yesJournal of Computer and System Sciences, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

On the power of cooperation: a regular representation of recursively enumerable languages

open access: yesTheoretical Computer Science, 1991
A cooperating distributed grammar system (CDGS), as introduced by \textit{E. Csuhaj-Varju} and \textit{J. Dassow} [J. Inform. Process. Cybern. EIK 26, 49-63 (1990)] is a construct \(\gamma=(N,T,G_ 1,\dots\), \(G_ n,S)\), where \(N\), \(T\) are nonterminal and terminal vocabularies, \(S\in N\) and \(G_ i=(N_ i,T_ i,S_ i,P_ i)\) are grammars with \(N_ i ...
Erzsébet Csuhaj-Varjú, Jozef Kelemen
openaire   +1 more source

On Splitting an Infinite Recursively Enumerable Class

open access: yes, 1975
By an RE (recursively enumerable) sequence we mean a sequence V(0), V(1), … of uniformly RE sets, denotes the class of all RE sets. If is an RE class if either for some RE sequence V(0), V(1) , … .
J. B. Florence
core   +1 more source

On the learnability of recursively enumerable languages from good examples

open access: yesTheoretical Computer Science, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sanjay Jain 0001   +2 more
openaire   +3 more sources

Almost recursively enumerable sets

open access: yes, 1972
An injective function on N, the nonnegative integers, taking values in N, is called almost recursive (abbreviated a.r.) if its inverse has a partial recursive extension. The range of an a.r.
John W. Berry
core   +1 more source

Characterizations of recursively enumerable languages by means of insertion grammars

open access: yesTheoretical Computer Science, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Carlos Martín-Vide   +2 more
openaire   +3 more sources

Difference Splittings of Recursively Enumerable Sets

open access: yes, 1997
We study here the degree-theoretic structure of set-theoretical splittings of recursively enumerable (r.e.) sets into differences of r.e. sets. As a corollary we deduce that the odering of wtt-degrees of unsolvability of differences of r.e. sets is not a
Arslanov, Asat, Arslanov,Asat
core   +1 more source

Home - About - Disclaimer - Privacy