This HTML5 document contains 44 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n16http://localhost/temp/predkladatel/
n17http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n6http://linked.opendata.cz/resource/domain/vavai/projekt/
n11http://linked.opendata.cz/ontology/domain/vavai/
n13http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n19http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14310%2F10%3A00042811%21RIV11-GA0-14310___/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n10http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n12http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n7http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14310%2F10%3A00042811%21RIV11-GA0-14310___
rdf:type
n11:Vysledek skos:Concept
dcterms: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. 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.
dcterms:title
Computational power of two stacks with restricted communication Computational power of two stacks with restricted communication
skos:prefLabel
Computational power of two stacks with restricted communication Computational power of two stacks with restricted communication
skos:notation
RIV/00216224:14310/10:00042811!RIV11-GA0-14310___
n3:aktivita
n12:P n12:Z
n3:aktivity
P(GA201/09/1313), Z(MSM0021622409)
n3:cisloPeriodika
9
n3:dodaniDat
n7:2011
n3:domaciTvurceVysledku
n17:6751881
n3:druhVysledku
n9:J
n3:duvernostUdaju
n18:S
n3:entitaPredkladatele
n19:predkladatel
n3:idSjednocenehoVysledku
251721
n3:idVysledku
RIV/00216224:14310/10:00042811
n3:jazykVysledku
n4:eng
n3:klicovaSlova
Word rewriting; String rewriting; Post systems; Multi-pushdown machines; Communication; Universality
n3:klicoveSlovo
n10:Communication n10:String%20rewriting n10:Universality n10:Multi-pushdown%20machines n10:Post%20systems n10:Word%20rewriting
n3:kodStatuVydavatele
NL - Nizozemsko
n3:kontrolniKodProRIV
[5F8231D131C5]
n3:nazevZdroje
Information and Computation
n3:obor
n15:BA
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
3
n3:projekt
n6:GA201%2F09%2F1313
n3:rokUplatneniVysledku
n7:2010
n3:svazekPeriodika
208
n3:tvurceVysledku
Karhumäki, Juhani Kunc, Michal Okhotin, Alexander
n3:zamer
n13:MSM0021622409
s:issn
0890-5401
s:numberOfPages
30
n16:organizacniJednotka
14310