Results 221 to 230 of about 4,373 (234)

PC grammar systems with five context-free components generate all recursively enumerable languages

Theoretical Computer Science, 2003
György Vaszil
exaly  

Recursively Enumerable Languages

1999
openaire   +1 more source

Intersection-closed full AFL and the recursively enumerable languages

Information and Control, 1973
Seymour Ginsburg
exaly  

Partial learning of recursively enumerable languages

Theoretical Computer Science, 2016
Frank Stephan, Sandra Zilles
exaly  

Products of matrices and recursively enumerable sets

Journal of Computer and System Sciences, 2015
Juha Honkala
exaly  

Reducibilities among equivalence relations induced by recursively enumerable structures

Theoretical Computer Science, 2016
Alex Gavryushkin, Bakhadyr Khoussainov, Frank Stephan   +2 more
exaly  

Interpretability and Definability in the Recursively Enumerable Degrees

Proceedings of the London Mathematical Society, 1998
André Nies
exaly  

Recursively Enumerable Sets and Languages

2008
openaire   +1 more source

On a Class of Recursively Enumerable Sets

Mathematical Logic Quarterly, 1999
Farzad Didehvar
exaly  

Recursively Enumerable Equivalence Relations Modulo Finite Differences

Mathematical Logic Quarterly, 1994
André Nies
exaly