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
n19http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n20http://purl.org/net/nknouf/ns/bibtex#
n18http://localhost/temp/predkladatel/
n15http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n12http://linked.opendata.cz/resource/domain/vavai/projekt/
n14http://linked.opendata.cz/ontology/domain/vavai/
n8https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n17http://bibframe.org/vocab/
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/
n4http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21230%2F14%3A00217908%21RIV15-GA0-21230___/
n21http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n10http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n22http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n7http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F14%3A00217908%21RIV15-GA0-21230___
rdf:type
n14:Vysledek skos:Concept
dcterms:description
We present a constructive variant of the Hennie machine. It is demonstrated how it can facilitate the design of finite-state machines. We focus on the d eterministic version of the model and study its descriptional complexity. The model's suc cinctness is compared with common devices that include the nondeterministic finite automa ton, two-way finite automaton and pebble automaton. We present a constructive variant of the Hennie machine. It is demonstrated how it can facilitate the design of finite-state machines. We focus on the d eterministic version of the model and study its descriptional complexity. The model's suc cinctness is compared with common devices that include the nondeterministic finite automa ton, two-way finite automaton and pebble automaton.
dcterms:title
Weight-Reducing Hennie Machines and Their Descriptional Complexity Weight-Reducing Hennie Machines and Their Descriptional Complexity
skos:prefLabel
Weight-Reducing Hennie Machines and Their Descriptional Complexity Weight-Reducing Hennie Machines and Their Descriptional Complexity
skos:notation
RIV/68407700:21230/14:00217908!RIV15-GA0-21230___
n3:aktivita
n9:P
n3:aktivity
P(GAP103/10/0783)
n3:dodaniDat
n7:2015
n3:domaciTvurceVysledku
n15:8547777
n3:druhVysledku
n13:D
n3:duvernostUdaju
n21:S
n3:entitaPredkladatele
n4:predkladatel
n3:idSjednocenehoVysledku
56069
n3:idVysledku
RIV/68407700:21230/14:00217908
n3:jazykVysledku
n10:eng
n3:klicovaSlova
finite automata; two-way automata; Hennie machine; descriptional complexity
n3:klicoveSlovo
n5:descriptional%20complexity n5:two-way%20automata n5:finite%20automata n5:Hennie%20machine
n3:kontrolniKodProRIV
[D4CC3BDB5431]
n3:mistoKonaniAkce
Madrid
n3:mistoVydani
Berlin
n3:nazevZdroje
LATA 2014: Proceedings of the 8th International Conference on Language an d Automata Theory and Applications
n3:obor
n22:JD
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
1
n3:projekt
n12:GAP103%2F10%2F0783
n3:rokUplatneniVysledku
n7:2014
n3:tvurceVysledku
Průša, Daniel
n3:typAkce
n19:WRD
n3:zahajeniAkce
2014-03-10+01:00
s:issn
0302-9743
s:numberOfPages
12
n17:doi
10.1007/978-3-319-04921-2_45
n20:hasPublisher
Springer-Verlag
n8:isbn
978-3-319-04920-5
n18:organizacniJednotka
21230