This HTML5 document contains 47 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n5http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n10http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14310%2F11%3A00050221%21RIV12-GA0-14310___/
n18http://purl.org/net/nknouf/ns/bibtex#
n14http://localhost/temp/predkladatel/
n11http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n9http://linked.opendata.cz/resource/domain/vavai/projekt/
n23http://linked.opendata.cz/resource/domain/vavai/subjekt/
n21http://linked.opendata.cz/ontology/domain/vavai/
n24http://linked.opendata.cz/resource/domain/vavai/zamer/
n13https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n16http://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/
n19http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n22http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n17http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14310%2F11%3A00050221%21RIV12-GA0-14310___
rdf:type
skos:Concept n21:Vysledek
dcterms:description
A framework for the study of periodic behaviour of two-way deterministic finite automata (2DFA) is developed. Computations of 2DFAs are represented by a two-way analogue of transformation semigroups, every element of which describes the behaviour of a 2DFA on a certain string x. A subsemigroup generated by this element represents the behaviour on strings in x^+. The main contribution of this paper is a description of all such monogenic subsemigroups up to isomorphism. This characterization is then used to show that transforming an n-state 2DFA over a one-letter alphabet to an equivalent sweeping 2DFA requires exactly n + 1 states, and transforming it to a one-way automaton requires exactly max{G(n-l) + l + 1 | 0 <= l <= n} states, where G(k) is the maximum order of a permutation of k elements. A framework for the study of periodic behaviour of two-way deterministic finite automata (2DFA) is developed. Computations of 2DFAs are represented by a two-way analogue of transformation semigroups, every element of which describes the behaviour of a 2DFA on a certain string x. A subsemigroup generated by this element represents the behaviour on strings in x^+. The main contribution of this paper is a description of all such monogenic subsemigroups up to isomorphism. This characterization is then used to show that transforming an n-state 2DFA over a one-letter alphabet to an equivalent sweeping 2DFA requires exactly n + 1 states, and transforming it to a one-way automaton requires exactly max{G(n-l) + l + 1 | 0 <= l <= n} states, where G(k) is the maximum order of a permutation of k elements.
dcterms:title
Describing periodicity in two-way deterministic finite automata using transformation semigroups Describing periodicity in two-way deterministic finite automata using transformation semigroups
skos:prefLabel
Describing periodicity in two-way deterministic finite automata using transformation semigroups Describing periodicity in two-way deterministic finite automata using transformation semigroups
skos:notation
RIV/00216224:14310/11:00050221!RIV12-GA0-14310___
n21:predkladatel
n23:orjk%3A14310
n3:aktivita
n22:Z n22:P
n3:aktivity
P(GA201/09/1313), Z(MSM0021622409)
n3:dodaniDat
n17:2012
n3:domaciTvurceVysledku
n11:6751881
n3:druhVysledku
n4:D
n3:duvernostUdaju
n19:S
n3:entitaPredkladatele
n10:predkladatel
n3:idSjednocenehoVysledku
193462
n3:idVysledku
RIV/00216224:14310/11:00050221
n3:jazykVysledku
n12:eng
n3:klicovaSlova
finite automata; two-way deterministic automata; periodicity; transformation semigroups; unary languages
n3:klicoveSlovo
n6:two-way%20deterministic%20automata n6:unary%20languages n6:finite%20automata n6:transformation%20semigroups n6:periodicity
n3:kontrolniKodProRIV
[14307EAEAE52]
n3:mistoKonaniAkce
Milan, Italy
n3:mistoVydani
Berlin
n3:nazevZdroje
Developments in Language Theory: 15th International Conference, DLT 2011, Milan, Italy, July 19-22, 2011. Proceedings
n3:obor
n15:BA
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
2
n3:projekt
n9:GA201%2F09%2F1313
n3:rokUplatneniVysledku
n17:2011
n3:tvurceVysledku
Okhotin, Alexander Kunc, Michal
n3:typAkce
n5:WRD
n3:zahajeniAkce
2011-01-01+01:00
n3:zamer
n24:MSM0021622409
s:issn
0302-9743
s:numberOfPages
13
n16:doi
10.1007/978-3-642-22321-1_28
n18:hasPublisher
Springer-Verlag
n13:isbn
978-3-642-22320-4
n14:organizacniJednotka
14310