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

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

Namespace Prefixes

PrefixIRI
n15http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n11http://purl.org/net/nknouf/ns/bibtex#
n4http://localhost/temp/predkladatel/
n16http://linked.opendata.cz/resource/domain/vavai/projekt/
n10http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n17http://linked.opendata.cz/ontology/domain/vavai/
n20https://schema.org/
shttp://schema.org/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/
skoshttp://www.w3.org/2004/02/skos/core#
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n18http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F61989100%3A27240%2F10%3A86075823%21RIV11-MSM-27240___/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n21http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n19http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n8http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F61989100%3A27240%2F10%3A86075823%21RIV11-MSM-27240___
rdf:type
skos:Concept n17:Vysledek
dcterms:description
Chrobak (1986) proved that a language accepted by a given nondeterministic finite automaton with one-letter alphabet, i.e., a unary NFA, with n states can be represented as the union of O(n(2)) arithmetic progressions, and Martinez (2002) has shown how to compute these progressions in polynomial time. To (2009) has pointed out recently that Chrobak's construction and Martinez's algorithm, which is based on it, contain a subtle error and has shown how they can be corrected. In this paper, a new simpler and more efficient algorithm for the same problem is presented. The running time of the presented algorithm is O(n(2)(n+m)), where n is the number of states and m the number of transitions of a given unary NFA. Chrobak (1986) proved that a language accepted by a given nondeterministic finite automaton with one-letter alphabet, i.e., a unary NFA, with n states can be represented as the union of O(n(2)) arithmetic progressions, and Martinez (2002) has shown how to compute these progressions in polynomial time. To (2009) has pointed out recently that Chrobak's construction and Martinez's algorithm, which is based on it, contain a subtle error and has shown how they can be corrected. In this paper, a new simpler and more efficient algorithm for the same problem is presented. The running time of the presented algorithm is O(n(2)(n+m)), where n is the number of states and m the number of transitions of a given unary NFA.
dcterms:title
Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA
skos:prefLabel
Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA
skos:notation
RIV/61989100:27240/10:86075823!RIV11-MSM-27240___
n6:aktivita
n19:P
n6:aktivity
P(1M0567)
n6:dodaniDat
n8:2011
n6:domaciTvurceVysledku
n10:2066041
n6:druhVysledku
n9:D
n6:duvernostUdaju
n21:S
n6:entitaPredkladatele
n18:predkladatel
n6:idSjednocenehoVysledku
256391
n6:idVysledku
RIV/61989100:27240/10:86075823
n6:jazykVysledku
n14:eng
n6:klicovaSlova
semilinear representation; nondeterministic finite automaton; unary language
n6:klicoveSlovo
n7:semilinear%20representation n7:nondeterministic%20finite%20automaton n7:unary%20language
n6:kontrolniKodProRIV
[F04994599892]
n6:mistoKonaniAkce
Brno, Česká republika
n6:mistoVydani
Berlin Heidelberg
n6:nazevZdroje
Reachability Problems
n6:obor
n12:IN
n6:pocetDomacichTvurcuVysledku
1
n6:pocetTvurcuVysledku
1
n6:projekt
n16:1M0567
n6:rokUplatneniVysledku
n8:2010
n6:tvurceVysledku
Sawa, Zdeněk
n6:typAkce
n15:WRD
n6:wos
000283104200012
n6:zahajeniAkce
2010-08-28+02:00
s:issn
0302-9743
s:numberOfPages
7
n11:hasPublisher
Springer-Verlag. (Berlin; Heidelberg)
n20:isbn
978-3-642-15348-8
n4:organizacniJednotka
27240