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

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

Namespace Prefixes

PrefixIRI
n21http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n22http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216208%3A11320%2F09%3A00206898%21RIV10-MSM-11320___/
n12http://purl.org/net/nknouf/ns/bibtex#
n5http://localhost/temp/predkladatel/
n18http://linked.opendata.cz/resource/domain/vavai/projekt/
n14http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n8http://linked.opendata.cz/ontology/domain/vavai/
n10http://linked.opendata.cz/resource/domain/vavai/zamer/
n9https://schema.org/
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#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n19http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n16http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n20http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F09%3A00206898%21RIV10-MSM-11320___
rdf:type
n8:Vysledek skos:Concept
dcterms:description
Restarting automata were introduced as a model for analysis by reduction which is a linguistically motivated method for checking correctness of a sentence. We propose a new restricted version of restarting automata called clearing restarting automata with a very simple definition but simultaneously with interesting properties with respect to their possible applications. The new model can be learned very efficiently from positive examples and its stronger version enables to learn effectively a large class of languages. We relate the class of languages recognized by clearing restarting automata to the Chomsky hierarchy. Restarting automata were introduced as a model for analysis by reduction which is a linguistically motivated method for checking correctness of a sentence. We propose a new restricted version of restarting automata called clearing restarting automata with a very simple definition but simultaneously with interesting properties with respect to their possible applications. The new model can be learned very efficiently from positive examples and its stronger version enables to learn effectively a large class of languages. We relate the class of languages recognized by clearing restarting automata to the Chomsky hierarchy.
dcterms:title
Clearing Restarting Automata Clearing Restarting Automata
skos:prefLabel
Clearing Restarting Automata Clearing Restarting Automata
skos:notation
RIV/00216208:11320/09:00206898!RIV10-MSM-11320___
n3:aktivita
n16:P n16:Z
n3:aktivity
P(1ET100300517), Z(MSM0021620838)
n3:dodaniDat
n20:2010
n3:domaciTvurceVysledku
n14:5680050
n3:druhVysledku
n13:D
n3:duvernostUdaju
n19:S
n3:entitaPredkladatele
n22:predkladatel
n3:idSjednocenehoVysledku
307254
n3:idVysledku
RIV/00216208:11320/09:00206898
n3:jazykVysledku
n7:eng
n3:klicovaSlova
Clearing; Restarting; Automata
n3:klicoveSlovo
n4:Restarting n4:Automata n4:Clearing
n3:kontrolniKodProRIV
[88FE56F97408]
n3:mistoKonaniAkce
Wien
n3:mistoVydani
Wien
n3:nazevZdroje
Workshop on Non-Classical Models for Automata and Applications (NCMA)
n3:obor
n17:BA
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
2
n3:projekt
n18:1ET100300517
n3:rokUplatneniVysledku
n20:2009
n3:tvurceVysledku
Mráz, František Černo, Peter
n3:typAkce
n21:EUR
n3:zahajeniAkce
2009-01-01+01:00
n3:zamer
n10:MSM0021620838
s:numberOfPages
14
n12:hasPublisher
Österreichisches Computer Gesellschaft
n9:isbn
978-3-85403-256-4
n5:organizacniJednotka
11320