This HTML5 document contains 34 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/
n7http://localhost/temp/predkladatel/
n9http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n13http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21230%2F12%3A00200615%21RIV13-GA0-21230___/
n6http://linked.opendata.cz/resource/domain/vavai/projekt/
n17http://linked.opendata.cz/resource/domain/vavai/subjekt/
n15http://linked.opendata.cz/ontology/domain/vavai/
skoshttp://www.w3.org/2004/02/skos/core#
n4http://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#
n8http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n16http://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/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n14http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F12%3A00200615%21RIV13-GA0-21230___
rdf:type
n15:Vysledek skos:Concept
dcterms:description
We introduce two new models of two-dimensional computing devices called sgraffito automaton and restarting tiling automaton. The models fulfill two conditions. Firstly, they do not exceed the power of finite-state automata when working over one-dimensional inputs. And secondly, they allow a clear design of important computations. We study properties of the induced families of picture languages. We show that they include strictly REC and that restarting tiling automata are able to simulate sgraffito automata. An interesting family is settled by deterministic sgraffito automata. It can be seen as an alternative to DREC. We introduce two new models of two-dimensional computing devices called sgraffito automaton and restarting tiling automaton. The models fulfill two conditions. Firstly, they do not exceed the power of finite-state automata when working over one-dimensional inputs. And secondly, they allow a clear design of important computations. We study properties of the induced families of picture languages. We show that they include strictly REC and that restarting tiling automata are able to simulate sgraffito automata. An interesting family is settled by deterministic sgraffito automata. It can be seen as an alternative to DREC.
dcterms:title
New Models for Recognition of Picture Languages: Sgraffito and Restarting Tiling Automata New Models for Recognition of Picture Languages: Sgraffito and Restarting Tiling Automata
skos:prefLabel
New Models for Recognition of Picture Languages: Sgraffito and Restarting Tiling Automata New Models for Recognition of Picture Languages: Sgraffito and Restarting Tiling Automata
skos:notation
RIV/68407700:21230/12:00200615!RIV13-GA0-21230___
n15:predkladatel
n17:orjk%3A21230
n4:aktivita
n16:P
n4:aktivity
P(GAP103/10/0783)
n4:dodaniDat
n14:2013
n4:domaciTvurceVysledku
n9:8547777
n4:druhVysledku
n5:O
n4:duvernostUdaju
n10:S
n4:entitaPredkladatele
n13:predkladatel
n4:idSjednocenehoVysledku
154062
n4:idVysledku
RIV/68407700:21230/12:00200615
n4:jazykVysledku
n11:eng
n4:klicovaSlova
two-dimensional languages; automata; family REC; lower bounds on time complexity
n4:klicoveSlovo
n8:lower%20bounds%20on%20time%20complexity n8:two-dimensional%20languages n8:family%20REC n8:automata
n4:kontrolniKodProRIV
[76DB23010E31]
n4:obor
n18:JD
n4:pocetDomacichTvurcuVysledku
1
n4:pocetTvurcuVysledku
2
n4:projekt
n6:GAP103%2F10%2F0783
n4:rokUplatneniVysledku
n14:2012
n4:tvurceVysledku
Mráz, F. Průša, Daniel
n7:organizacniJednotka
21230