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
n9http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n22http://localhost/temp/predkladatel/
n13http://purl.org/net/nknouf/ns/bibtex#
n17http://linked.opendata.cz/resource/domain/vavai/projekt/
n14http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n5http://linked.opendata.cz/resource/domain/vavai/subjekt/
n4http://linked.opendata.cz/ontology/domain/vavai/
n20https://schema.org/
shttp://schema.org/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/
skoshttp://www.w3.org/2004/02/skos/core#
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n18http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n19http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n15http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n10http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216208%3A11320%2F12%3A10130694%21RIV13-GA0-11320___/
n21http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n7http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F12%3A10130694%21RIV13-GA0-11320___
rdf:type
n4:Vysledek skos:Concept
dcterms:description
In the literature various types of restarting automata have been studied that are based on contextual rewriting. A word w is accepted by such an automaton if, starting from the initial conguration that corresponds to input w, the word w is reduced to the empty word within a finite number of applications of these contextual rewritings. This approach is reminiscent of the notion of McNaughton families of languages. Here we put the aforementioned types of restarting automata into the context of McNaughton families of languages, relating the classes of languages accepted by these automata in particular to the class GCSL of growing context-sensitive languages and to the class CRL of Church-Rosser languages. In the literature various types of restarting automata have been studied that are based on contextual rewriting. A word w is accepted by such an automaton if, starting from the initial conguration that corresponds to input w, the word w is reduced to the empty word within a finite number of applications of these contextual rewritings. This approach is reminiscent of the notion of McNaughton families of languages. Here we put the aforementioned types of restarting automata into the context of McNaughton families of languages, relating the classes of languages accepted by these automata in particular to the class GCSL of growing context-sensitive languages and to the class CRL of Church-Rosser languages.
dcterms:title
Limited context restarting automata and McNaughton families of languages Limited context restarting automata and McNaughton families of languages
skos:prefLabel
Limited context restarting automata and McNaughton families of languages Limited context restarting automata and McNaughton families of languages
skos:notation
RIV/00216208:11320/12:10130694!RIV13-GA0-11320___
n4:predkladatel
n5:orjk%3A11320
n6:aktivita
n15:S n15:P
n6:aktivity
P(GAP103/10/0783), P(GAP202/10/1333), S
n6:dodaniDat
n7:2013
n6:domaciTvurceVysledku
n14:5680050 n14:3920445
n6:druhVysledku
n8:D
n6:duvernostUdaju
n19:S
n6:entitaPredkladatele
n10:predkladatel
n6:idSjednocenehoVysledku
147084
n6:idVysledku
RIV/00216208:11320/12:10130694
n6:jazykVysledku
n11:eng
n6:klicovaSlova
McNaughton languages; restarting automata
n6:klicoveSlovo
n18:McNaughton%20languages n18:restarting%20automata
n6:kontrolniKodProRIV
[D976C23D1721]
n6:mistoKonaniAkce
Fribourg, Switzerland
n6:mistoVydani
Vienna
n6:nazevZdroje
Proceedings of the NCMA 2012 4th International Workshop on Non-Classical Models of Automata and Applications
n6:obor
n21:IN
n6:pocetDomacichTvurcuVysledku
2
n6:pocetTvurcuVysledku
3
n6:projekt
n17:GAP103%2F10%2F0783 n17:GAP202%2F10%2F1333
n6:rokUplatneniVysledku
n7:2012
n6:tvurceVysledku
Otto, Friedrich Černo, Peter Mráz, František
n6:typAkce
n9:EUR
n6:zahajeniAkce
2012-08-23+02:00
s:numberOfPages
16
n13:hasPublisher
Österreichische Computer Gesellschaft
n20:isbn
978-3-85403-290-8
n22:organizacniJednotka
11320