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
n22http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n21http://purl.org/net/nknouf/ns/bibtex#
n17http://localhost/temp/predkladatel/
n8http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n5http://linked.opendata.cz/resource/domain/vavai/subjekt/
n4http://linked.opendata.cz/ontology/domain/vavai/
n12https://schema.org/
n13http://linked.opendata.cz/resource/domain/vavai/zamer/
n6http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216305%3A26230%2F11%3APU96019%21RIV12-MSM-26230___/
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#
n11http://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/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n20http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216305%3A26230%2F11%3APU96019%21RIV12-MSM-26230___
rdf:type
skos:Concept n4:Vysledek
dcterms:description
In the present paper, we discuss programmed grammars. More specifically, we discuss their nondeterministic behaviour and its reduction. We prove that for every programmed grammar, there exists an equivalent programmed grammar where only a single rule has more than one successor.  Furthermore, we establish an infinite hierarchy of language families resulting from the cardinality of successor sets. Open problem areas are formulated in the conclusion of the paper. In the present paper, we discuss programmed grammars. More specifically, we discuss their nondeterministic behaviour and its reduction. We prove that for every programmed grammar, there exists an equivalent programmed grammar where only a single rule has more than one successor.  Furthermore, we establish an infinite hierarchy of language families resulting from the cardinality of successor sets. Open problem areas are formulated in the conclusion of the paper.
dcterms:title
On Nondeterminism in Programmed Grammars On Nondeterminism in Programmed Grammars
skos:prefLabel
On Nondeterminism in Programmed Grammars On Nondeterminism in Programmed Grammars
skos:notation
RIV/00216305:26230/11:PU96019!RIV12-MSM-26230___
n4:predkladatel
n5:orjk%3A26230
n3:aktivita
n16:S n16:Z
n3:aktivity
S, Z(MSM0021630528)
n3:dodaniDat
n20:2012
n3:domaciTvurceVysledku
n8:6513247 n8:6107818 n8:4411439
n3:druhVysledku
n10:D
n3:duvernostUdaju
n19:S
n3:entitaPredkladatele
n6:predkladatel
n3:idSjednocenehoVysledku
218080
n3:idVysledku
RIV/00216305:26230/11:PU96019
n3:jazykVysledku
n14:eng
n3:klicovaSlova
Formal languages, Programmed grammars, Nondeterminism, Generative power
n3:klicoveSlovo
n11:Formal%20languages n11:Nondeterminism n11:Programmed%20grammars n11:Generative%20power
n3:kontrolniKodProRIV
[917D590B27CA]
n3:mistoKonaniAkce
Debrecen
n3:mistoVydani
Debrecen
n3:nazevZdroje
13th International Conference on Automata and Formal Languages
n3:obor
n18:IN
n3:pocetDomacichTvurcuVysledku
3
n3:pocetTvurcuVysledku
3
n3:rokUplatneniVysledku
n20:2011
n3:tvurceVysledku
Vrábel, Lukáš Zemek, Petr Meduna, Alexandr
n3:typAkce
n22:WRD
n3:zahajeniAkce
2011-08-17+02:00
n3:zamer
n13:MSM0021630528
s:numberOfPages
13
n21:hasPublisher
Computer and Automation Research Institute, Hungarian Academy of Sciences
n12:isbn
978-615-5097-19-5
n17:organizacniJednotka
26230