• TUCS Publication Series
• How to Publish in TUCS Series
• Publication Search
• Publication Graph
• Publication Input
• Publication Input Guide
• JuFo Browser

Computational Power of Two Stacks with Restricted Communication

Juhani Karhumäki, Michal Kunc, Alexander Okhotin, Computational Power of Two Stacks with Restricted Communication. Information and Computation 208(9), 1060–1089 , 2010.

http://dx.doi.org/10.1016/j.ic.2009.07.001

Abstract:

Rewriting systems working on words with a center marker are considered. The derivation is done by erasing a prefix or a suffix and then adding a prefix or a suffix. This models a communication of two stacks according to a fixed protocol defined by the choice of rewriting rules. The paper systematically considers different cases of these systems and determines their expressive power. Several cases are identified where very restricted communication surprisingly yields computational universality.

BibTeX entry:

@ARTICLE{jKaKuOk10a,
  title = {Computational Power of Two Stacks with Restricted Communication},
  author = {Karhumäki, Juhani and Kunc, Michal and Okhotin, Alexander},
  journal = {Information and Computation},
  volume = {208},
  number = {9},
  pages = {1060–1089 },
  year = {2010},
}

Belongs to TUCS Research Unit(s): FUNDIM, Fundamentals of Computing and Discrete Mathematics

Publication Forum rating of this publication: level 3

Edit publication