Results 171 to 180 of about 793,130 (202)
Some of the next articles are maybe not open access.

On characterizations of recursively enumerable languages

Acta Informatica, 1990
\textit{V. Geffert} [Theor. Comput. Sci. 62, 235-249 (1988; Zbl 0664.68075)] has shown that each recursively enumerable language L over \(\Sigma\) can be expressed in the form \(L=\{h(x)^{-1}g(x)|\) x in \(\Delta^+\}\cap \Sigma^*\) where \(\Delta\) is an alphabet and g, h is a pair of morphisms.
Michel Latteux, Paavo Turakainen
openaire   +3 more sources

Flow languages equal recursively enumerable languages

Acta Informatica, 1981
Recently, A.C. Shaw introduced a new class of expressions called flow expressions, and conjectured that the formal descriptive power of flow expressions lies somewhat below context-sensitive grammers. In this paper, we give a negative answer for his conjecture, that is, we show that all recursively enumerable languages may be denoted by flow ...
Toshiro Araki, Nobuki Tokura
openaire   +3 more sources

Interpretability and Definability in the Recursively Enumerable Degrees

open access: yesProceedings of the London Mathematical Society, 1998
We investigate definability in R, the recursively enumerable Turing degrees, using codings of standard models of arithmetic (SMA’s) as a tool. First we show that an SMA can be interpreted in R without parameters.
Andre Nies
exaly   +1 more source

Closure properties for fuzzy recursively enumerable languages and fuzzy recursive languages

Journal of Intelligent & Fuzzy Systems, 2016
There are several variations of fuzzy Turing machines in the literature, many of them require a t-norm in order to establish their accepted language. This paper generalize the concept of non-deterministic fuzzy Turing machine - NTFM, replacing the t-norm operator for several aggregation functions.
Antonio Diego Silva Farias   +3 more
openaire   +2 more sources

Global Syntax and Semantics for Recursively Enumerable Languages

Fundamenta Informaticae, 1981
According to (Benson, 1970), a syntax is a category of strings and derivations (modulo similarity) between them. In this paper the semantic domain is an elementary topes. Thus, an interpretation of a syntax is a cofunctor taking strigs to products and derivations to morphisms.
Cristian Calude, Gheorghe Paun
openaire   +3 more sources

On Conservative Learning of Recursively Enumerable Languages

2013
Conservative partial learning is a variant of partial learning whereby the learner, on a text for a target language L, outputs one index e with L = W e infinitely often and every further hypothesis d is output only finitely often and satisfies \(L \not\subseteq W_d\).
Ziyuan Gao   +2 more
openaire   +1 more source

Grammar systems as language analyzers and recursively enumerable languages

1999
We consider parallel communicating grammar systems which consist of several grammars and perform derivation steps, where each of the grammars works in a parallel and synchronized manner on its own sentential form, and communication steps, where a transfer of sentential forms is done.
Henning Bordihn   +2 more
openaire   +2 more sources

Characterizations of Recursively Enumerable Languages by Programmed Grammars with Unconditional Transfer

J. Autom. Lang. Comb., 1999
We prove that every recursively enumerable language can be generated by a programmed grammar with context-free core rules using unconditional transfer with left-most derivation of type 3 or type 2. Interestingly, we have to give a non-constructive proof of the first mentioned universality result based on Higman's lemma, since finding a transformation ...
Henning Fernau, Frank Stephan 0001
openaire   +3 more sources

Polynomial Generators of Recursively Enumerable Languages

2005
For each language L, let $\hat{\mathcal F}_\cap(L)$ be the smallest intersection-closed full AFL generated by the language L. Furthermore, for each natural number k≥ 2 let $P_k=\{a^{n^k}|n\in\mathbb N\}$. By applying certain classical and recent results on Diophantine equations we show that $\mathcal L_{RE}=\hat{\mathcal F}_\cap(P_k)$, i.e., the family
openaire   +1 more source

A characterization of recursively enumerable languages

Bull. EATCS, 1991
It is shown that each recursively enumerable language \(L\) can be written in the form \(L=\text{red}(L_ 0)\cap V^*\), where red is the reduction operation considered in \textit{H. A. Maurer}, \textit{G. Rozenberg} and \textit{E. Welzl} [Inf. Control 54, 155-185 (1982; Zbl 0523.68065)], \(L_ 0\) is a linear language, and \(V\) is the alphabet of \(L\).
openaire   +2 more sources

Home - About - Disclaimer - Privacy