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
dctermshttp://purl.org/dc/terms/
n9http://localhost/temp/predkladatel/
n10http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n16http://linked.opendata.cz/resource/domain/vavai/subjekt/
n6http://linked.opendata.cz/ontology/domain/vavai/
n18http://linked.opendata.cz/resource/domain/vavai/zamer/
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#
n5http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n13http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216305%3A26230%2F11%3APU91074%21RIV12-MSM-26230___/
n19http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n15http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n4http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216305%3A26230%2F11%3APU91074%21RIV12-MSM-26230___
rdf:type
n6:Vysledek skos:Concept
dcterms:description
The notion of a one-sided random context grammar is defined as a context-free-based regulated grammar, in which a set of permitting symbols and a set of forbidding symbols are attached to every rule, and its set of rules is divided into the set of left random context rules and the set of right random context rules. A left random context rule can rewrite a nonterminal if each of its permitting symbols occurs to the left of the rewritten symbol in the current sentential form while each of its forbidding symbols does not occur there. A right random context rule is applied analogically except that the symbols are examined to the right of the rewritten symbol. The paper demonstrates that without erasing rules, one-sided random context grammars characterize the family of context-sensitive languages, and with erasing rules, these grammars characterize the family of recursively enumerable languages. In fact, these characterization results hold even if the set of left random context rules coinci The notion of a one-sided random context grammar is defined as a context-free-based regulated grammar, in which a set of permitting symbols and a set of forbidding symbols are attached to every rule, and its set of rules is divided into the set of left random context rules and the set of right random context rules. A left random context rule can rewrite a nonterminal if each of its permitting symbols occurs to the left of the rewritten symbol in the current sentential form while each of its forbidding symbols does not occur there. A right random context rule is applied analogically except that the symbols are examined to the right of the rewritten symbol. The paper demonstrates that without erasing rules, one-sided random context grammars characterize the family of context-sensitive languages, and with erasing rules, these grammars characterize the family of recursively enumerable languages. In fact, these characterization results hold even if the set of left random context rules coinci
dcterms:title
One-Sided Random Context Grammars One-Sided Random Context Grammars
skos:prefLabel
One-Sided Random Context Grammars One-Sided Random Context Grammars
skos:notation
RIV/00216305:26230/11:PU91074!RIV12-MSM-26230___
n6:predkladatel
n16:orjk%3A26230
n3:aktivita
n7:Z
n3:aktivity
Z(MSM0021630528)
n3:cisloPeriodika
3
n3:dodaniDat
n4:2012
n3:domaciTvurceVysledku
n10:4411439 n10:6513247
n3:druhVysledku
n12:J
n3:duvernostUdaju
n19:S
n3:entitaPredkladatele
n13:predkladatel
n3:idSjednocenehoVysledku
218356
n3:idVysledku
RIV/00216305:26230/11:PU91074
n3:jazykVysledku
n15:eng
n3:klicovaSlova
Regulated rewriting, random context grammars, one-sided variants, generative power, language families
n3:klicoveSlovo
n5:generative%20power n5:random%20context%20grammars n5:language%20families n5:one-sided%20variants n5:Regulated%20rewriting
n3:kodStatuVydavatele
DE - Spolková republika Německo
n3:kontrolniKodProRIV
[62EDB25FCC7D]
n3:nazevZdroje
Acta Informatica
n3:obor
n17:IN
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
2
n3:rokUplatneniVysledku
n4:2011
n3:svazekPeriodika
48
n3:tvurceVysledku
Meduna, Alexandr Zemek, Petr
n3:zamer
n18:MSM0021630528
s:issn
0001-5903
s:numberOfPages
15
n9:organizacniJednotka
26230