The Community for Technology Leaders
Green Image
Issue No. 07 - July (1975 vol. 24)
ISSN: 0018-9340
pp: 741-742
S.A. Greibach , Department of System Science, University of California
Given two nonempty sets of nonempty codewords S = {s<inf>1</inf>,...,s<inf>n</inf>} and T = {t<inf>1</inf>,...,t<inf>m</inf>}, it is decidable whether there are i<inf>1</inf>,...,l<inf>k</inf>and j<inf>1</inf>,...,j<inf>k</inf>such that s<inf>i1</inf>...s<inf>ik</inf>= t<inf>j1</inf>...t<inf>jk</inf>, and furthermore, the set of all such solutions is a one counter language.
Code set, context-free language, correspondence problem, decision problem, one counter language.
S.A. Greibach, "A Remark on Code Sets and Context-Free Languages", IEEE Transactions on Computers, vol. 24, no. , pp. 741-742, July 1975, doi:10.1109/T-C.1975.224294
92 ms
(Ver 3.3 (11022016))