Communication of two stacks and rewriting

2Citations
Citations of this article
21Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Karhumäki, J., Kunc, M., & Okhotin, A. (2006). Communication of two stacks and rewriting. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4052 LNCS, pp. 468–479). Springer Verlag. https://doi.org/10.1007/11787006_40

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free