Computational power of two stacks with restricted communication

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14310%2F10%3A00042811" target="_blank" >RIV/00216224:14310/10:00042811 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Computational power of two stacks with restricted communication

Original language description

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.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BA - General mathematics

OECD FORD branch

—

Project

<a href="/en/project/GA201%2F09%2F1313" target="_blank" >GA201/09/1313: Algebraic Methods in Automata and Formal Language Theory II</a><br>

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2010

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Information and Computation

ISSN

0890-5401

e-ISSN

—

Volume of the periodical

208

Issue of the periodical within the volume

9

Country of publishing house

NL - THE KINGDOM OF THE NETHERLANDS

Number of pages

30

Pages from-to

—

UT code for WoS article

—

EID of the result in the Scopus database

—