Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,823,707 papers from all fields of science
Search
Sign In
Create Free Account
Recursively enumerable language
Known as:
Turing recognizable
, Recursively enumerable languages
, Recognizable language
Expand
In mathematics, logic and computer science, a formal language is called recursively enumerable (also recognizable, partially decidable, semidecidable…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
34 relations
Abstract family of languages
Arithmetical hierarchy
Automata theory
Chomsky hierarchy
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Partial actions and automata
M. Dokuchaev
,
B. Novikov
,
G. Zholtkevych
arXiv.org
2013
Corpus ID: 13902962
We use the notion of a partial action of a monoid to introduce a generalization of automata, which we call "a preautomaton". We…
Expand
2005
2005
Non-returning PC Grammar Systems Generate Any Recursively Enumerable Language with Eight Context-free Components
György Vaszil
Workshop on Descriptional Complexity of Formal…
2005
Corpus ID: 6377443
We show how to generate any recursively enumerable language with a nonreturning PC grammar system having eight context-free…
Expand
1999
1999
Recursively Enumerable Languages
D. Simovici
,
R. L. Tenney
1999
Corpus ID: 124996769
A TM accepts a string w if the TM halts in a final state. A TM rejects a string w if the TM halts in a nonfinal state or the TM…
Expand
1999
1999
Grammar Systems as Language Analyzers and Recursively Enumerable Languages
Henning Bordihn
,
J. Dassow
,
György Vaszil
International Symposium on Fundamentals of…
1999
Corpus ID: 17623112
We consider parallel communicating grammar systems which consist of several grammars and perform derivation steps, where each of…
Expand
1998
1998
Recursive estimation-maximization (R.E-M.) : an algorithm for segmentation
Panayiotis Peter Kamvysselis
1998
Corpus ID: 58490924
We present a model-based segmentation algorithm, R.E-M for recursive estimation-maximization. The algorithm iterates between…
Expand
1997
1997
Four-nonterminal scattered context grammars characterize the family of recursively enumerable languages
A. Meduna
International Journal of Computational…
1997
Corpus ID: 123000945
The family of recursively enumerable languages is characterized by scattered context grammars with four nonterminals. Moreover…
Expand
1987
1987
Recursively Enumerable L-Sets
L. Biacino
,
Giangiacomo Gerla
Mathematical Logic Quarterly
1987
Corpus ID: 32602214
1984
1984
Decidable subspaces and recursively enumerable subspaces
C. Ash
,
R. Downey
Journal of Symbolic Logic (JSL)
1984
Corpus ID: 29457008
Abstract A subspace V of an infinite dimensional fully effective vector space V∞ is called decidable if V is r.e. and there…
Expand
1979
1979
Automorphisms of the Lattice of Recursively Enumerable Vector Spaces
I. Kalantari
Mathematical Logic Quarterly
1979
Corpus ID: 29384291
1971
1971
A class of decidable intermediate propositional logics
C. G. McKay
Journal of Symbolic Logic (JSL)
1971
Corpus ID: 9650011
For the terminology and motivation of this note, my earlier paper [3] should be consulted. Here I make a slight change by…
Expand