Title :
A Remark on Code Sets and Context-Free Languages
Author_Institution :
Department of System Science, University of California
fDate :
7/1/1975 12:00:00 AM
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.
Keywords :
Code set, context-free language, correspondence problem, decision problem, one counter language.; Counting circuits; Encoding; Tin; Vocabulary; Code set, context-free language, correspondence problem, decision problem, one counter language.;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/T-C.1975.224294
