Computational power of two stacks with restricted communication

Authors:
Juhani Karhumäki;Michal Kunc;Alexander Okhotin
Affiliations:
Department of Mathematics, University of Turku, Turku FI-20014, Finland;Department of Mathematics, Masaryk University, Brno, Czech Republic;Department of Mathematics, University of Turku, Turku FI-20014, Finland and Academy of Finland, Helsinki, Finland
Venue:
Information and Computation
Year:
2010

Citing 8
Cited 1

Formal languages

Formal languages
Reversal-Bounded Multicounter Machines and Their Decision Problems

Journal of the ACM (JACM)
Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages

Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Deleting string rewriting systems preserve regularity

Theoretical Computer Science - Developments in language theory
Computing by commuting

Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
The Power of Commuting with Finite Sets of Words

Theory of Computing Systems
Reversal-bounded multipushdown machines

Journal of Computer and System Sciences

Circular post machines and p systems with exo-insertion and deletion

CMC'11 Proceedings of the 12th international conference on Membrane Computing

Quantified Score

Hi-index	0.00

Visualization

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.