Results 121 to 130 of about 3,677,609 (156)
Some of the next articles are maybe not open access.

Fuzzy Grammars and Recursively Enumerable Fuzzy Languages

Information Sciences, 1992
A fuzzy language ( \(L\)-language) is treated as an \(L\)-subset of \(A^*\) with \(A^*\) being a free monoid of an alphabet defined over a finite set \(A\). The main result of the paper states that if \(L\) is finite then an \(L\)-language is generated by an \(L\)-grammar if and only if it is a recursively enumerable \(L\)-subset.
Giangiacomo Gerla
exaly   +4 more sources

Six-Nonterminal Multi-Sequential Grammars Characterize the Family of Recursively Enumerable Languages

International Journal of Computer Mathematics, 1997
The present paper investigates the descriptional complexity of multi-sequential grammars with respect to the number of nonterminals. This investigation demonstrates that the family of recursively enumerable languages is characterized by six-nonterminal multi-sequential grammars.
Alexander Meduna
exaly   +2 more sources

Four-Nonterminal Scattered Context Grammars Characterize the Family of Recursively Enumerable Languages

International Journal of Computer Mathematics, 1997
The family of recursively enumerable languages is characterized by scattered context grammars with four nonterminals. Moreover, this family is characterized by scattered context grammars with three nonterminals if these grammars start their derivations from a word rather than a symbol.
Alexander Meduna
exaly   +2 more sources

Scattered Context Grammars Generate Any Recursively Enumerable Language With Two Nonterminals

Information Processing Letters, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
György Vaszil
exaly   +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

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

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

Home - About - Disclaimer - Privacy