On representing recursively enumerable languages by internal contextual languages

Author： Ehrenfeucht A. Paun G. Rozenberg G.

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.205, Iss.1, 1998-08, pp. : 61-83

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Characterizations of recursively enumerable languages by means of insertion grammars

By Martin-Vide C. Paun G. Salomaa A.

Theoretical Computer Science, Vol. 205, Iss. 1, 1998-08 ,pp. : 195-205

Elsevier

Access to resources Recommend Favorite

Homomorphic characterizations of recursively enumerable languages with very small language classes

By Okawa S. Hirose S.

Theoretical Computer Science, Vol. 250, Iss. 1, 2001-01 ,pp. : 55-69

Elsevier

Access to resources Recommend Favorite

PC grammar systems with five context-free components generate all recursively enumerable languages

By Csuhaj-Varju E. Paun G. Vaszil G.

Theoretical Computer Science, Vol. 299, Iss. 1, 2003-04 ,pp. : 785-794

Elsevier

Access to resources Recommend Favorite

On computational complexity of contextual languages

By Ilie L.

Theoretical Computer Science, Vol. 183, Iss. 1, 1997-08 ,pp. : 33-44

Elsevier

Access to resources Recommend Favorite

Most general first order theorems are not recursively enumerable

By Schurz G.

Theoretical Computer Science, Vol. 147, Iss. 1, 1995-08 ,pp. : 149-163

Elsevier

Access to resources Recommend Favorite