This HTML5 document contains 48 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/
n19http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216208%3A11320%2F09%3A00206906%21RIV10-MSM-11320___/
n13http://localhost/temp/predkladatel/
n14http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n6http://linked.opendata.cz/resource/domain/vavai/projekt/
n16http://linked.opendata.cz/ontology/domain/vavai/
n17http://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#
n9http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n15http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n11http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F09%3A00206906%21RIV10-MSM-11320___
rdf:type
skos:Concept n16:Vysledek
dcterms:description
Restarting automata can be seen as analytical variants of classical automata as well as of regulated rewriting systems. We study a measure for the degree of nondeterminism of (context-free) languages in terms of deterministic restarting automata that are (strongly) lexicalized. This measure is based on the number of occurrences of auxiliary symbols (categories) used for recognizing a language as the projection of its characteristic language onto its input alphabet. This type of recognition is typical for analysis by reduction, a method used in linguistics for the creation and verification of formal descriptions of natural languages. Our main results establish a hierarchy of classes of context-free languages and two hierarchies of classes of non-context-free languages that are based on the expansion factor of a language. Restarting automata can be seen as analytical variants of classical automata as well as of regulated rewriting systems. We study a measure for the degree of nondeterminism of (context-free) languages in terms of deterministic restarting automata that are (strongly) lexicalized. This measure is based on the number of occurrences of auxiliary symbols (categories) used for recognizing a language as the projection of its characteristic language onto its input alphabet. This type of recognition is typical for analysis by reduction, a method used in linguistics for the creation and verification of formal descriptions of natural languages. Our main results establish a hierarchy of classes of context-free languages and two hierarchies of classes of non-context-free languages that are based on the expansion factor of a language.
dcterms:title
The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages
skos:prefLabel
The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages
skos:notation
RIV/00216208:11320/09:00206906!RIV10-MSM-11320___
n3:aktivita
n4:P n4:Z
n3:aktivity
P(1ET100300517), Z(MSM0021620838)
n3:cisloPeriodika
37
n3:dodaniDat
n11:2010
n3:domaciTvurceVysledku
n14:2985640 n14:5680050
n3:druhVysledku
n18:J
n3:duvernostUdaju
n10:S
n3:entitaPredkladatele
n19:predkladatel
n3:idSjednocenehoVysledku
309306
n3:idVysledku
RIV/00216208:11320/09:00206906
n3:jazykVysledku
n15:eng
n3:klicovaSlova
degree; word-expansion; lexicalized; RRWW-automata; measure; degree; nondeterminism; context-free; languages
n3:klicoveSlovo
n9:context-free n9:degree n9:nondeterminism n9:measure n9:languages n9:word-expansion n9:lexicalized n9:RRWW-automata
n3:kodStatuVydavatele
FR - Francouzská republika
n3:kontrolniKodProRIV
[E8515F9807B8]
n3:nazevZdroje
Theoretical Computer Science
n3:obor
n5:BA
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
3
n3:projekt
n6:1ET100300517
n3:rokUplatneniVysledku
n11:2009
n3:svazekPeriodika
410
n3:tvurceVysledku
Plátek, Martin Mráz, František Otto, Friedrich
n3:wos
000269304000011
n3:zamer
n17:MSM0021620838
s:issn
0304-3975
s:numberOfPages
9
n13:organizacniJednotka
11320