Recursively Enumerable Languages
Recursively Enumerable Languages is a class of formal languages that comprises all languages for which there exists a Turing machine that halts and accepts every string in the language, while either rejecting or looping indefinitely on strings not in the language.
137
Publications
4.8K
Citations
173
Authors
99
Institutions
Publications per year
2017–2026
5
Variants
Semi-decidable LanguagesTuring-recognizable Languages
Parents
137
An introduction to formal language theory
Choice Reviews Online · 1989 · 471 citations
The Recursively Enumerable Degrees are Dense
Gerald E. Sacks · Annals of Mathematics · 1964 · 206 citations
Languages with Expressions of Infinite Length.
Erwin Engeler, Carol R. Karp · American Mathematical Monthly · 1966 · 174 citations
On String Languages Generated by Spiking Neural P Systems
Haiming Chen, Rudolf Freund, Mihai Ionescu et al. · idUS (Universidad de Sevilla) · 2007 · 160 citations
1–5 of 137
173
11
h-index
7
h-index
6
h-index
5
h-index
5
h-index
1–5 of 173
99

Universitat Rovira i Virgili
Tarragona, Spain
11 h-index
14 publications
469 citations

Romanian Academy
Bucharest, Romania
8 h-index
8 publications
296 citations
Brno University of Technology
Brno, Czechia
6 h-index
9 publications
115 citations

TU Wien
Vienna, Austria
6 h-index
8 publications
290 citations

Universidad de Sevilla
Seville, Spain
6 h-index
9 publications
435 citations

Hungarian Academy of Sciences
Budapest, Hungary
5 h-index
8 publications
168 citations

Academy of Sciences of Moldova
Chisinau, Moldova
4 h-index
5 publications
79 citations

University of Leeds
Leeds, United Kingdom
3 h-index
3 publications
44 citations
1–8 of 99
18 publications · 458 citations
13
h-index
IJFCS · 9 publications · 258 citations
9
h-index
9 publications · 178 citations
9
h-index
5 publications · 93 citations
5
h-index
4 publications · 63 citations
4
h-index
1–5