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

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

Namespace Prefixes

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

Statements

Subject Item
n2:RIV%2F00216224%3A14310%2F11%3A00050222%21RIV12-GA0-14310___
rdf:type
n12:Vysledek skos:Concept
dcterms:description
The paper determines the number of states in a two-way deterministic finite automaton (2DFA) over a one-letter alphabet sufficient and in the worst case necessary to represent the results of the following operations: (i) intersection of an m-state 2DFA and an n-state 2DFA requires between m + n and m + n + 1 states; (ii) union of an m-state 2DFA and an n-state 2DFA, between m + n and 2m + n + 4 states; (iii) Kleene star of an n-state 2DFA, (g(n) + O(n))^2 states, where g(n) = e^(sqrt(n.ln(n))(1 + o(1))) is the maximum value of lcm(p1,...,pk) for p1 +...+ pk <= n, known as Landau’s function; (iv) k-th power of an n-state 2DFA, between (k - 1)g(n) - k and k.(g(n) + n) states; (v) concatenation of an m-state and an n-state 2DFAs, e^((1 + o(1)).sqrt((m + n).ln(m + n))) states. The paper determines the number of states in a two-way deterministic finite automaton (2DFA) over a one-letter alphabet sufficient and in the worst case necessary to represent the results of the following operations: (i) intersection of an m-state 2DFA and an n-state 2DFA requires between m + n and m + n + 1 states; (ii) union of an m-state 2DFA and an n-state 2DFA, between m + n and 2m + n + 4 states; (iii) Kleene star of an n-state 2DFA, (g(n) + O(n))^2 states, where g(n) = e^(sqrt(n.ln(n))(1 + o(1))) is the maximum value of lcm(p1,...,pk) for p1 +...+ pk <= n, known as Landau’s function; (iv) k-th power of an n-state 2DFA, between (k - 1)g(n) - k and k.(g(n) + n) states; (v) concatenation of an m-state and an n-state 2DFAs, e^((1 + o(1)).sqrt((m + n).ln(m + n))) states.
dcterms:title
State complexity of operations on two-way deterministic finite automata over a unary alphabet State complexity of operations on two-way deterministic finite automata over a unary alphabet
skos:prefLabel
State complexity of operations on two-way deterministic finite automata over a unary alphabet State complexity of operations on two-way deterministic finite automata over a unary alphabet
skos:notation
RIV/00216224:14310/11:00050222!RIV12-GA0-14310___
n12:predkladatel
n13:orjk%3A14310
n3:aktivita
n4:P n4:Z
n3:aktivity
P(GA201/09/1313), Z(MSM0021622409)
n3:dodaniDat
n11:2012
n3:domaciTvurceVysledku
n19:6751881
n3:druhVysledku
n20:D
n3:duvernostUdaju
n10:S
n3:entitaPredkladatele
n14:predkladatel
n3:idSjednocenehoVysledku
232149
n3:idVysledku
RIV/00216224:14310/11:00050222
n3:jazykVysledku
n22:eng
n3:klicovaSlova
finite automata; two-way automata; state complexity
n3:klicoveSlovo
n6:two-way%20automata n6:state%20complexity n6:finite%20automata
n3:kontrolniKodProRIV
[344BBA628676]
n3:mistoKonaniAkce
Gießen/Limburg, Germany
n3:mistoVydani
Berlin
n3:nazevZdroje
Descriptional Complexity of Formal Systems: 13th International Workshop, DCFS 2011, Gießen/Limburg, Germany, July 25-27, 2011. Proceedings
n3:obor
n23:BA
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
2
n3:projekt
n9:GA201%2F09%2F1313
n3:rokUplatneniVysledku
n11:2011
n3:tvurceVysledku
Okhotin, Alexander Kunc, Michal
n3:typAkce
n16:WRD
n3:zahajeniAkce
2011-01-01+01:00
n3:zamer
n18:MSM0021622409
s:issn
0302-9743
s:numberOfPages
13
n24:doi
10.1007/978-3-642-22600-7_18
n21:hasPublisher
Springer-Verlag
n15:isbn
978-3-642-22599-4
n5:organizacniJednotka
14310