Další formáty:
BibTeX
LaTeX
RIS
@article{1074305, author = {Kunc, Michal and Okhotin, Alexander}, article_location = {Amsterdam}, article_number = {1}, doi = {http://dx.doi.org/10.1016/j.tcs.2012.04.010}, keywords = {Finite automata; Two-way automata; Regular languages; Unary languages; State complexity; Landau's function}, language = {eng}, issn = {0304-3975}, journal = {Theoretical Computer Science}, title = {State complexity of operations on two-way finite automata over a unary alphabet}, volume = {449}, year = {2012} }
TY - JOUR ID - 1074305 AU - Kunc, Michal - Okhotin, Alexander PY - 2012 TI - State complexity of operations on two-way finite automata over a unary alphabet JF - Theoretical Computer Science VL - 449 IS - 1 SP - 106-118 EP - 106-118 PB - Elsevier SN - 03043975 KW - Finite automata KW - Two-way automata KW - Regular languages KW - Unary languages KW - State complexity KW - Landau's function N2 - The paper determines the number of states in two-way deterministic finite automata (2DFA) over a one-letter alphabet sufficient and in the worst case necessary to represent the results of basic language-theoretic operations on 2DFAs with a certain number of states. It is proved that (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 is 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 2DFA and an n-state 2DFA, exp((1+O(1))sqrt((m+n)ln(m+n))) states. It is furthermore demonstrated that the Kleene star of a two-way nondeterministic automaton (2NFA) with n states requires Theta(g(n)) states in the worst case, its k-th power requires (k g(n))^(Theta(1)) states, and the concatenation of an m-state 2NFA and an n-state 2NFA, exp(Theta(sqrt((m+n)ln(m+n)))) states. ER -
KUNC, Michal a Alexander OKHOTIN. State complexity of operations on two-way finite automata over a unary alphabet. \textit{Theoretical Computer Science}. Amsterdam: Elsevier, 2012, roč.~449, č.~1, s.~106-118. ISSN~0304-3975. Dostupné z: https://dx.doi.org/10.1016/j.tcs.2012.04.010.
|