A Remark on Code Sets and Context-Free Languages

Authors:
S. A. Greibach
Affiliations:
Department of System Science, University of California
Venue:
IEEE Transactions on Computers
Year:
1975

Citing 0
Cited 3

More decidable instances of Post's correspondence problem: beyond counting

Information Processing Letters
A useful device for showing the solvability of some decision problems

Journal of Computer and System Sciences
On the Decidability of Some Problems Concerning Morphisms, Regular Sets, and Post Correspondence Problem

Fundamenta Informaticae

Quantified Score

Hi-index	14.98

Visualization

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.