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
n4http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n20http://purl.org/net/nknouf/ns/bibtex#
n16http://localhost/temp/predkladatel/
n19http://linked.opendata.cz/resource/domain/vavai/projekt/
n8http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n23http://linked.opendata.cz/ontology/domain/vavai/
n9http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21230%2F14%3A00223264%21RIV15-GA0-21230___/
n14https://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/
n10http://bibframe.org/vocab/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n6http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n22http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n17http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n12http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F14%3A00223264%21RIV15-GA0-21230___
rdf:type
skos:Concept n23:Vysledek
rdfs:seeAlso
http://dx.doi.org/10.1007/978-3-319-09704-6_31
dcterms:description
We study succinctness of descriptional systems for picture languages. Basic models of two-dimensional finite automata and generalizations of context-free grammars are considered. It is shown t hat non-recursive trade-offs between the systems are very common. The results are based on the ability of th e systems to simulate Turing machines. We study succinctness of descriptional systems for picture languages. Basic models of two-dimensional finite automata and generalizations of context-free grammars are considered. It is shown t hat non-recursive trade-offs between the systems are very common. The results are based on the ability of th e systems to simulate Turing machines.
dcterms:title
Non-recursive Trade-offs between Two-Dimensional Automata and Grammars Non-recursive Trade-offs between Two-Dimensional Automata and Grammars
skos:prefLabel
Non-recursive Trade-offs between Two-Dimensional Automata and Grammars Non-recursive Trade-offs between Two-Dimensional Automata and Grammars
skos:notation
RIV/68407700:21230/14:00223264!RIV15-GA0-21230___
n3:aktivita
n17:P
n3:aktivity
P(GAP103/10/0783)
n3:dodaniDat
n12:2015
n3:domaciTvurceVysledku
n8:8547777
n3:druhVysledku
n13:D
n3:duvernostUdaju
n22:S
n3:entitaPredkladatele
n9:predkladatel
n3:idSjednocenehoVysledku
32826
n3:idVysledku
RIV/68407700:21230/14:00223264
n3:jazykVysledku
n11:eng
n3:klicovaSlova
picture languages; four-way automata; two-dimensional context-free grammars; des criptional complexity
n3:klicoveSlovo
n6:des%20criptional%20complexity n6:four-way%20automata n6:picture%20languages n6:two-dimensional%20context-free%20grammars
n3:kontrolniKodProRIV
[8518D9B40CCC]
n3:mistoKonaniAkce
Turku
n3:mistoVydani
Berlin
n3:nazevZdroje
DCFS 2014: Proceedings of the 16th International Workshop on Descriptional Complexity of Formal Systems
n3:obor
n18:JD
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
1
n3:projekt
n19:GAP103%2F10%2F0783
n3:rokUplatneniVysledku
n12:2014
n3:tvurceVysledku
Průša, Daniel
n3:typAkce
n4:WRD
n3:wos
000343868700031
n3:zahajeniAkce
2014-08-05+02:00
s:issn
0302-9743
s:numberOfPages
12
n10:doi
10.1007/978-3-319-09704-6_31
n20:hasPublisher
Springer-Verlag
n14:isbn
978-3-319-09703-9
n16:organizacniJednotka
21230