Results 221 to 230 of about 550 (233)

Equality languages, fixed point languages and representations of recursively enumerable languages

19th Annual Symposium on Foundations of Computer Science (sfcs 1978), 1978
Joost Engelfriet, Grzegorz Rozenberg
openaire   +1 more source

A trivial method of characterizing the family of recursively enumerable languages by scattered context grammars

Bull. EATCS, 1995
Summary: The family of the recursively enumerable languages is characterized by scattered context grammars by using an extremely simple method.
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, Frank Stephan, Bakhadyr Khoussainov   +2 more
exaly  

Recursively Enumerable Languages

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  

At the crossroads of DNA computing and formal languages: Characterizing recursively enumerable languages using insertion-deletion systems

1999
Lila Kari, Gheorghe Paun, Gabriel Thierrin, Sheng Yu 0001   +3 more
openaire   +1 more source