Parallel communicating grammar systems with incomplete information communication

Erzsébet Csuhaj-Varjú, György Vaszil

Research output: Contribution to journalArticle

Abstract

Parallel communicating grammar systems with incomplete information communication were examined. It was shown that context-free returning PC grammar systems were able to generate any recursively enumerable language if they communicate only prefixes, suffixes or arbitary subwords of their sentential forms. The results were based on the possibility of comparing the lengths of strings by shortening them with a certain number of symbols step by step using incomplete communication.

Original languageEnglish
Pages (from-to)153-176
Number of pages24
JournalGrammars
Volume5
Issue number3
Publication statusPublished - Dec 1 2002

    Fingerprint

Keywords

  • Incomplete information communication
  • Parallel communicating grammar systems
  • Recursively enumerable languages

ASJC Scopus subject areas

  • Management of Technology and Innovation

Cite this