This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Remark on Code Sets and Context-Free Languages
July 1975 (vol. 24 no. 7)
pp. 741-742
S.A. Greibach, Department of System Science, University of California
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.
Index Terms:
Code set, context-free language, correspondence problem, decision problem, one counter language.
Citation:
S.A. Greibach, "A Remark on Code Sets and Context-Free Languages," IEEE Transactions on Computers, vol. 24, no. 7, pp. 741-742, July 1975, doi:10.1109/T-C.1975.224294
Usage of this product signifies your acceptance of the Terms of Use.