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

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F12%3A10130955%21RIV13-GA0-11320___
rdf:type
n7:Vysledek skos:Concept
rdfs:seeAlso
http://itat.ics.upjs.sk/proceedings/ITAT2012%20-%20CEUR%20Proceedings%20-%20tlacova%20verzia.pdf
dcterms:description
A reducing automaton (red-automaton) is a deterministic automaton proposed for checking word and sub-word correctness by the use of analysis by reduction. Its monotone version characterizes the class of deterministic context-free languages (DCFL). We propose a method for a construction of a deterministic monotone enhancement of any monotone reducing automaton which is able with the help of special auxiliary symbols to localize its prefix and post-prefix (in)consistencies, and certain types of reducing conflicts. In other words this method ensures a robust analysis by reduction without spurious error messages. We formulate natural conditions for which this method ensures the localization of all prefix and post-prefix inconsistencies in any (incorrect) word with respect to a DCFL. A reducing automaton (red-automaton) is a deterministic automaton proposed for checking word and sub-word correctness by the use of analysis by reduction. Its monotone version characterizes the class of deterministic context-free languages (DCFL). We propose a method for a construction of a deterministic monotone enhancement of any monotone reducing automaton which is able with the help of special auxiliary symbols to localize its prefix and post-prefix (in)consistencies, and certain types of reducing conflicts. In other words this method ensures a robust analysis by reduction without spurious error messages. We formulate natural conditions for which this method ensures the localization of all prefix and post-prefix inconsistencies in any (incorrect) word with respect to a DCFL.
dcterms:title
Localization of (in)consistencies by monotone reducing automata Localization of (in)consistencies by monotone reducing automata
skos:prefLabel
Localization of (in)consistencies by monotone reducing automata Localization of (in)consistencies by monotone reducing automata
skos:notation
RIV/00216208:11320/12:10130955!RIV13-GA0-11320___
n7:predkladatel
n8:orjk%3A11320
n3:aktivita
n22:P
n3:aktivity
P(GAP103/10/0783), P(GAP202/10/1333)
n3:dodaniDat
n18:2013
n3:domaciTvurceVysledku
n23:2985640
n3:druhVysledku
n6:D
n3:duvernostUdaju
n16:S
n3:entitaPredkladatele
n19:predkladatel
n3:idSjednocenehoVysledku
147325
n3:idVysledku
RIV/00216208:11320/12:10130955
n3:jazykVysledku
n11:eng
n3:klicovaSlova
monotony, DCFL, syntactic errors; reducing automata
n3:klicoveSlovo
n4:syntactic%20errors n4:reducing%20automata n4:DCFL n4:monotony
n3:kontrolniKodProRIV
[1904B37C6C0D]
n3:mistoKonaniAkce
Ždiar, Slovakia
n3:mistoVydani
Košice, Slovakia
n3:nazevZdroje
Information Technologies - Applications and Theory, Conference on Theory and Practice of Information Technologies, Proceedings
n3:obor
n15:IN
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
2
n3:projekt
n20:GAP103%2F10%2F0783 n20:GAP202%2F10%2F1333
n3:rokUplatneniVysledku
n18:2012
n3:tvurceVysledku
Procházka, Martin Plátek, Martin
n3:typAkce
n5:CST
n3:zahajeniAkce
2012-09-17+02:00
s:numberOfPages
8
n9:hasPublisher
Slovenská spoločnosť pre umelú inteligenciu
n10:isbn
978-80-971144-0-4
n14:organizacniJednotka
11320