About: Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
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. (en)
Title	Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA (en)
skos:prefLabel	Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA (en)
skos:notation	RIV/61989100:27240/10:86075823!RIV11-MSM-27240___
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(1M0567)
http://linked.open...vai/riv/dodaniDat	2011
http://linked.open...aciTvurceVysledku	Sawa, Zdeněk
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Vysoká škola báňská - Technická univerzita Ostrava / Fakulta elektrotechniky a informatiky
http://linked.open...dnocenehoVysledku	256391
http://linked.open...ai/riv/idVysledku	RIV/61989100:27240/10:86075823
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	semilinear representation; nondeterministic finite automaton; unary language (en)
http://linked.open.../riv/klicoveSlovo	nondeterministic finite automaton semilinear representation unary language
http://linked.open...ontrolniKodProRIV	[F04994599892]
http://linked.open...v/mistoKonaniAkce	Brno, Česká republika
http://linked.open...i/riv/mistoVydani	Berlin Heidelberg
http://linked.open...i/riv/nazevZdroje	Reachability Problems
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	1 (xsd:int)
http://linked.open...vavai/riv/projekt	Centre for Applied Cybernetics
http://linked.open...UplatneniVysledku	2010
http://linked.open...iv/tvurceVysledku	Sawa, Zdeněk
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open...ain/vavai/riv/wos	000283104200012
http://linked.open.../riv/zahajeniAkce	2010-08-28 (xsd:date)
issn	0302-9743
number of pages	7 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Springer-Verlag. (Berlin; Heidelberg)
https://schema.org/isbn	978-3-642-15348-8
http://localhost/t...ganizacniJednotka	27240
is http://linked.open...avai/riv/vysledek of	Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software