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

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

Namespace Prefixes

PrefixIRI
n24http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n23http://localhost/temp/predkladatel/
n15http://purl.org/net/nknouf/ns/bibtex#
n22http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n17http://linked.opendata.cz/resource/domain/vavai/projekt/
n8http://linked.opendata.cz/resource/domain/vavai/subjekt/
n7http://linked.opendata.cz/ontology/domain/vavai/
n11https://schema.org/
n5http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216208%3A11320%2F13%3A10145557%21RIV14-GA0-11320___/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
rdfshttp://www.w3.org/2000/01/rdf-schema#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/
n19http://bibframe.org/vocab/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n13http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n20http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n14http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F13%3A10145557%21RIV14-GA0-11320___
rdf:type
skos:Concept n7:Vysledek
rdfs:seeAlso
http://dx.doi.org/10.1007/978-3-642-39274-0_23
dcterms:description
Clearing restarting automata are based on contextual rewriting. A word w is accepted by an automaton of this type if there is a computation that reduces the word w to the empty word Î}} by a finite sequence of rewritings. Accordingly, the word problem for a clearing restarting automaton can be solved nondeterministically in quadratic time. If, however, the contextual rewritings happen to be Î}}-confluent, that is, confluent on the congruence class of the empty word, then the word problem can be solved deterministically in linear time. Here we show that, unfortunately, Î}}-confluence is not even recursively enumerable for clearing restarting automata. This follows from the fact that Î}}-confluence is not recursively enumerable for finite factor-erasing string-rewriting systems. Clearing restarting automata are based on contextual rewriting. A word w is accepted by an automaton of this type if there is a computation that reduces the word w to the empty word Î}} by a finite sequence of rewritings. Accordingly, the word problem for a clearing restarting automaton can be solved nondeterministically in quadratic time. If, however, the contextual rewritings happen to be Î}}-confluent, that is, confluent on the congruence class of the empty word, then the word problem can be solved deterministically in linear time. Here we show that, unfortunately, Î}}-confluence is not even recursively enumerable for clearing restarting automata. This follows from the fact that Î}}-confluence is not recursively enumerable for finite factor-erasing string-rewriting systems.
dcterms:title
Lambda-Confluence Is Undecidable for Clearing Restarting Automata Lambda-Confluence Is Undecidable for Clearing Restarting Automata
skos:prefLabel
Lambda-Confluence Is Undecidable for Clearing Restarting Automata Lambda-Confluence Is Undecidable for Clearing Restarting Automata
skos:notation
RIV/00216208:11320/13:10145557!RIV14-GA0-11320___
n7:predkladatel
n8:orjk%3A11320
n4:aktivita
n6:P
n4:aktivity
P(GAP103/10/0783)
n4:dodaniDat
n14:2014
n4:domaciTvurceVysledku
n22:5680050
n4:druhVysledku
n18:D
n4:duvernostUdaju
n10:S
n4:entitaPredkladatele
n5:predkladatel
n4:idSjednocenehoVysledku
84237
n4:idVysledku
RIV/00216208:11320/13:10145557
n4:jazykVysledku
n20:eng
n4:klicovaSlova
limited context restarting automaton; factor-erasing string-rewriting system; Clearing restarting automaton; lamda-confluence
n4:klicoveSlovo
n13:lamda-confluence n13:factor-erasing%20string-rewriting%20system n13:Clearing%20restarting%20automaton n13:limited%20context%20restarting%20automaton
n4:kontrolniKodProRIV
[B6AFE7F7C419]
n4:mistoKonaniAkce
Halifax, Kanada
n4:mistoVydani
Berlin
n4:nazevZdroje
Implementation and Application of Automata
n4:obor
n16:IN
n4:pocetDomacichTvurcuVysledku
1
n4:pocetTvurcuVysledku
2
n4:projekt
n17:GAP103%2F10%2F0783
n4:rokUplatneniVysledku
n14:2013
n4:tvurceVysledku
Mráz, František Otto, Friedrich
n4:typAkce
n24:WRD
n4:zahajeniAkce
2013-07-16+02:00
s:issn
0302-9743
s:numberOfPages
12
n19:doi
10.1007/978-3-642-39274-0_23
n15:hasPublisher
Springer-Verlag
n11:isbn
978-3-642-39273-3
n23:organizacniJednotka
11320