Communication of two stacks and rewriting

Authors:
Juhani Karhumäki;Michal Kunc;Alexander Okhotin
Affiliations:
Department of Mathematics, University of Turku, Turku Centre for Computer Science, Turku, Finland;Department of Mathematics, University of Turku, Turku Centre for Computer Science, Turku, Finland;Department of Mathematics, University of Turku, Turku Centre for Computer Science, Turku, Finland
Venue:
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Year:
2006

Citing 5
Cited 2

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
Reversal-bounded multipushdown machines

Journal of Computer and System Sciences
The power of commuting with finite sets of words

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science

On Bifix Systems and Generalizations

Language and Automata Theory and Applications
The Reachability Problem over Infinite Graphs

CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications

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 can be naturally viewed as two stacks communicating with each other according to a fixed protocol. The paper systematically considers different cases of these systems and determines their expressiveness. Several cases are identified where very limited communication surprisingly yields universal computation power