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

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

Namespace Prefixes

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

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F14%3A10289402%21RIV15-MSM-11320___
rdf:type
skos:Concept n12:Vysledek
dcterms:description
The paper provides linguistic observations as a motivation for a formal study of an analysis by reduction. It concentrates on a study of the whole mechanism through a class of restarting automata with meta-instructions using pebbles, with delete and shift operations (DSautomata). Four types of (in)finite sets defined by these automata are considered as linguistically relevant: basic languages on word forms marked with grammatical categories, proper languages on unmarked word forms, categorial languages on grammatical categories, and sets of reductions (reduction languages). The equivalence of proper languages is considered for a weak equivalence of DS-automata, and the equivalence of reduction languages for a strong equivalence of DS-automata. The complexity of a language is naturally measured by the number of pebbles, the number of deletions, and the number of word order shifts used in a single reduction step. We have obtained unbounded hierarchies (scales) for all four types of classes of finite lan The paper provides linguistic observations as a motivation for a formal study of an analysis by reduction. It concentrates on a study of the whole mechanism through a class of restarting automata with meta-instructions using pebbles, with delete and shift operations (DSautomata). Four types of (in)finite sets defined by these automata are considered as linguistically relevant: basic languages on word forms marked with grammatical categories, proper languages on unmarked word forms, categorial languages on grammatical categories, and sets of reductions (reduction languages). The equivalence of proper languages is considered for a weak equivalence of DS-automata, and the equivalence of reduction languages for a strong equivalence of DS-automata. The complexity of a language is naturally measured by the number of pebbles, the number of deletions, and the number of word order shifts used in a single reduction step. We have obtained unbounded hierarchies (scales) for all four types of classes of finite lan
dcterms:title
On Minimalism of Analysis by Reduction by Restarting Automata On Minimalism of Analysis by Reduction by Restarting Automata
skos:prefLabel
On Minimalism of Analysis by Reduction by Restarting Automata On Minimalism of Analysis by Reduction by Restarting Automata
skos:notation
RIV/00216208:11320/14:10289402!RIV15-MSM-11320___
n3:aktivita
n8:I n8:P
n3:aktivity
I, P(GAP103/10/0783), P(GAP202/10/1333)
n3:dodaniDat
n14:2015
n3:domaciTvurceVysledku
n17:2985640 n17:1248057
n3:druhVysledku
n21:D
n3:duvernostUdaju
n15:S
n3:entitaPredkladatele
n9:predkladatel
n3:idSjednocenehoVysledku
34323
n3:idVysledku
RIV/00216208:11320/14:10289402
n3:jazykVysledku
n20:eng
n3:klicovaSlova
automata; restarting; reduction; analysis; minimalism
n3:klicoveSlovo
n4:minimalism n4:restarting n4:analysis n4:automata n4:reduction
n3:kontrolniKodProRIV
[0E7B612E9971]
n3:mistoKonaniAkce
Tübingen, Germany
n3:mistoVydani
Heidelberg, Germany
n3:nazevZdroje
19th International Conference on Formal Grammar 2014
n3:obor
n18:IN
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
3
n3:projekt
n13:GAP103%2F10%2F0783 n13:GAP202%2F10%2F1333
n3:rokUplatneniVysledku
n14:2014
n3:tvurceVysledku
Plátek, Martin Lopatková, Markéta Pardubská, Dana
n3:typAkce
n6:WRD
n3:zahajeniAkce
2014-08-16+02:00
s:numberOfPages
16
n7:hasPublisher
Springer-Verlag
n19:isbn
978-3-662-44121-3
n5:organizacniJednotka
11320