Results 231 to 240 of about 501 (254)

Turing Machines, Recursively Enumerable Languages and Type 0 Grammars

1993
We have seen that a pushdown automaton can carry out computations which are beyond the capability of a finite automaton, which is perhaps the simplest sort of machine able to accept an infinite set of strings. At the other end of the scale of computational power is the Turing machine (after the English mathematician A. M.
Barbara H. Partee, Alice Ter Meulen, Robert E. Wall   +2 more
openaire   +1 more source

Representations of recursively enumerable array languages by contextual array grammars

Fundam. Informaticae, 2005
Summary: The main result proved in this paper shows that the natural embedding of any recursively enumerable one-dimensional array language in the two-dimensional space can be characterized by the projection of a two-dimensional array language generated by a contextual array grammar working in the \(t\)-mode and with norm one.
Henning Fernau, Rudolf Freund, Markus Holzer 0001   +2 more
openaire   +2 more sources

A unified approach to characterizations of recursively enumerable languages

Bull. EATCS, 1991
Summary: Starting from an arbitrary phrase structure grammar \(G\) we construct two morphisms such that several well known representations of \(L(G)\) are obtained in a unified and easy way. These include characterizations in terms of the quotient operation [(*) \textit{V. Geffert}, Theor. Comput. Sci. 62, No.
openaire   +1 more source

On the connection between the no free lunch theorem and the trivial property for recursively enumerable languages

The 2003 Congress on Evolutionary Computation, 2003. CEC '03., 2004
We return to the no free lunch theorem, which is one of the most important theorems from the evolutionary computation foundations. We show that the no free lunch theorem can be interpreted as a trivial property of recursively enumerable languages. We demonstrate that if we consider not all problems and cost functions, i.e., a nontrivial property, the ...
openaire   +1 more source

Intuitionistic fuzzy recursive enumerable languages and recursive languages

AIP Conference Proceedings, 2019
M. Rajasekar, V. Sumathi
openaire   +1 more source

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

Recursively Enumerable Languages

1999
openaire   +1 more source

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