1 research outputs found
A representation of recursively enumerable languages by two homomorphisms and a quotient
AbstractA new representation for recursively enumerable languages is presented. It uses a pair of homomorphisms and the left (or right) quotient: For each recursively enumerable language L one can find homomorphisms h1, h2: ββA β ββB, such that w β ββL is a word in L if and only if w =h1(Ξ±)h2(Ξ±) for some Ξ±ββ+A. (Or, each recursively enumerable language can be given by L = O(h1h2) β© ββL, where O(h1h2) is the so-called right overflow languaged defined as O(h1h2) = {h1(x)h2(x); x β ββA}.