State complexity of operations on two-way deterministic finite automata over a unary alphabet
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14310%2F11%3A00050222" target="_blank" >RIV/00216224:14310/11:00050222 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-642-22600-7_18" target="_blank" >http://dx.doi.org/10.1007/978-3-642-22600-7_18</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-22600-7_18" target="_blank" >10.1007/978-3-642-22600-7_18</a>
Alternative languages
Result language
angličtina
Original language name
State complexity of operations on two-way deterministic finite automata over a unary alphabet
Original language 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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA201%2F09%2F1313" target="_blank" >GA201/09/1313: Algebraic Methods in Automata and Formal Language Theory II</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Descriptional Complexity of Formal Systems: 13th International Workshop, DCFS 2011, Gießen/Limburg, Germany, July 25-27, 2011. Proceedings
ISBN
978-3-642-22599-4
ISSN
0302-9743
e-ISSN
—
Number of pages
13
Pages from-to
222-234
Publisher name
Springer
Place of publication
Berlin
Event location
Gießen/Limburg, Germany
Event date
Jan 1, 2011
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—