About: State complexity of operations on two-way deterministic finite automata over a unary alphabet

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

About: State complexity of operations on two-way deterministic finite automata over a unary alphabet 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	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. (en)
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 (en)
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 (en)
skos:notation	RIV/00216224:14310/11:00050222!RIV12-GA0-14310___
http://linked.open...avai/riv/aktivita	P Z
http://linked.open...avai/riv/aktivity	P(GA201/09/1313), Z(MSM0021622409)
http://linked.open...vai/riv/dodaniDat	2012
http://linked.open...aciTvurceVysledku	Kunc, Michal
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	Masarykova univerzita / Přírodovědecká fakulta
http://linked.open...dnocenehoVysledku	232149
http://linked.open...ai/riv/idVysledku	RIV/00216224:14310/11:00050222
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	finite automata; two-way automata; state complexity (en)
http://linked.open.../riv/klicoveSlovo	state complexity two-way automata finite automata
http://linked.open...ontrolniKodProRIV	[344BBA628676]
http://linked.open...v/mistoKonaniAkce	Gießen/Limburg, Germany
http://linked.open...i/riv/mistoVydani	Berlin
http://linked.open...i/riv/nazevZdroje	Descriptional Complexity of Formal Systems: 13th International Workshop, DCFS 2011, Gießen/Limburg, Germany, July 25-27, 2011. Proceedings
http://linked.open...in/vavai/riv/obor	BA
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	Algebraic Methods in Automata and Formal Language Theory II
http://linked.open...UplatneniVysledku	2011
http://linked.open...iv/tvurceVysledku	Kunc, Michal Okhotin, Alexander
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2011-01-01 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Matematické struktury a jejich fyzikální aplikace
issn	0302-9743
number of pages	13 (xsd:int)
http://bibframe.org/vocab/doi	10.1007/978-3-642-22600-7_18
http://purl.org/ne...btex#hasPublisher	Springer-Verlag
https://schema.org/isbn	978-3-642-22599-4
http://localhost/t...ganizacniJednotka	14310

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, 77 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software