• DocumentCode
    1118702
  • Title

    A Remark on Code Sets and Context-Free Languages

  • Author

    Greibach, S.A.

  • Author_Institution
    Department of System Science, University of California
  • Issue
    7
  • fYear
    1975
  • fDate
    7/1/1975 12:00:00 AM
  • Firstpage
    741
  • Lastpage
    742
  • 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.;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/T-C.1975.224294
  • Filename
    1672887
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1118702