This HTML5 document contains 43 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/
n13http://localhost/temp/predkladatel/
n18http://linked.opendata.cz/resource/domain/vavai/projekt/
n17http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n16http://linked.opendata.cz/ontology/domain/vavai/
n10http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F04%3A00010071%21RIV08-MSM-14330___/
n19http://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/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n15http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n14http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n9http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F04%3A00010071%21RIV08-MSM-14330___
rdf:type
skos:Concept n16:Vysledek
dcterms:description
Paris Kanellakis and the second author (Smolka) were among the first to investigate the computational complexity of bisimulation, and the first and third authors (Moller and Srba) have long-established track records in the field. Smolka and Moller have also written a brief survey about the computational complexity of bisimulation [Moller,Smolka'95]. The authors believe that the special issue of Information and Computation devoted to PCK50: Principles of Computing and Knowledge: Paris C. Kanellakis Memorial Workshop represents an ideal opportunity for an up-to-date look at the subject. Paris Kanellakis and the second author (Smolka) were among the first to investigate the computational complexity of bisimulation, and the first and third authors (Moller and Srba) have long-established track records in the field. Smolka and Moller have also written a brief survey about the computational complexity of bisimulation [Moller,Smolka'95]. The authors believe that the special issue of Information and Computation devoted to PCK50: Principles of Computing and Knowledge: Paris C. Kanellakis Memorial Workshop represents an ideal opportunity for an up-to-date look at the subject. Jedna se o prehledovy clanek, ktery poskytuje seznam vysledku a odkazu na ne z oblasti porovnavani nekonecne stavovych systemu vzhledem k semantickym ekvivalencim.
dcterms:title
On the Computational Complexity of Bisimulation, Redux Vypocetni slozitost bisimulace On the Computational Complexity of Bisimulation, Redux
skos:prefLabel
Vypocetni slozitost bisimulace On the Computational Complexity of Bisimulation, Redux On the Computational Complexity of Bisimulation, Redux
skos:notation
RIV/00216224:14330/04:00010071!RIV08-MSM-14330___
n3:strany
?
n3:aktivita
n5:Z n5:P
n3:aktivity
P(GA201/03/1161), Z(MSM 143300001)
n3:cisloPeriodika
?
n3:dodaniDat
n9:2008
n3:domaciTvurceVysledku
n17:2753057
n3:druhVysledku
n11:J
n3:duvernostUdaju
n7:S
n3:entitaPredkladatele
n10:predkladatel
n3:idSjednocenehoVysledku
577854
n3:idVysledku
RIV/00216224:14330/04:00010071
n3:jazykVysledku
n14:eng
n3:klicovaSlova
bisimilarity; complexity
n3:klicoveSlovo
n15:complexity n15:bisimilarity
n3:kodStatuVydavatele
NL - Nizozemsko
n3:kontrolniKodProRIV
[57D4B4ACB686]
n3:nazevZdroje
Information and Computation
n3:obor
n6:IN
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
3
n3:projekt
n18:GA201%2F03%2F1161
n3:rokUplatneniVysledku
n9:2004
n3:svazekPeriodika
?
n3:tvurceVysledku
Moller, Faron Smolka, Scot Srba, Jiří
n3:zamer
n19:MSM%20143300001
s:numberOfPages
20
n13:organizacniJednotka
14330