Computational power of two stacks with restricted communication
type: Item
instance of: scholarly article
title: Computational power of two stacks with restricted communication
zbMATH Open document ID: 1209.68288
author: Michal Kunc
author: Alexander Okhotin
author: Juhani Karhumäki
published in: Information and Computation
publication date: 2010-10-07T00:00:00Z
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5796744
zbMATH Keywords: word rewriting
zbMATH Keywords: string rewriting
zbMATH Keywords: post systems
zbMATH Keywords: multi-pushdown machines
zbMATH Keywords: communication
zbMATH Keywords: universality
MaRDI profile type: Publication
full work available at URL: j.ic.2009.07.001
OpenAlex ID: W1993721751
cites work: Reversal-bounded multipushdown machines
cites work: Q5616207
cites work: Regular canonical systems
cites work: Q5639639
cites work: Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages
cites work: Counter machines and counter languages
cites work: Deleting string rewriting systems preserve regularity
cites work: Q5592246
cites work: Reversal-Bounded Multicounter Machines and Their Decision Problems
cites work: Q5586323
cites work: The power of commuting with finite sets of words
cites work: Recursive unsolvability of Post's problem of ''Tag'' und other topics in theory of Turing machines
cites work: Formal Reductions of the General Combinatorial Decision Problem
cites work: Q3651209
cites work: Q5678435
DOI: 10.1016/J.IC.2009.07.001
description: scientific article; zbMATH DE number 5796744