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

On representing recursively enumerable languages by internal contextual languages

By Ehrenfeucht A.   Paun G.   Rozenberg G.  

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

Elsevier

Access to resources Recommend Favorite

Isomorphism theorem for BSS recursively enumerable sets over real closed fields

By Michaux C.   Troestler C.  

Theoretical Computer Science, Vol. 231, Iss. 2, 2000-01 ,pp. : 253-273

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