Abstract
Given two nonempty sets of nonempty codewords S = {s1,...,sn} and T = {t1,...,tm}, it is decidable whether there are i1,...,lkand j1,...,jksuch that si1...sik= tj1...tjk, and furthermore, the set of all such solutions is a one counter language.

This publication has 0 references indexed in Scilit: