Author:
Hospodár Michal,Jirásková Galina
Abstract
We study the state complexity of the concatenation operation on regular languages represented by deterministic and alternating finite automata. For deterministic automata, we show that the upper bound m2n − k2n−1 on the state complexity of concatenation can be met by ternary languages, the first of which is accepted by an m-state DFA with k final states, and the second one by an n-state DFA with ℓ final states for arbitrary integers m, n, k, ℓ with 1 ≤ k ≤ m − 1 and 1 ≤ ℓ ≤ n − 1. In the case of k ≤ m − 2, we are able to provide appropriate binary witnesses. In the case of k = m − 1 and ℓ ≥ 2, we provide a lower bound which is smaller than the upper bound just by one. We use our binary witnesses for concatenation on deterministic automata to describe binary languages meeting the upper bound 2m + n + 1 for the concatenation on alternating finite automata. This solves an open problem stated by Fellah et al. [Int. J. Comput. Math. 35 (1990) 117–132].
Subject
Computer Science Applications,General Mathematics,Software
Reference14 articles.
1. On equations for regular languages, finite automata, and sequential networks
2. Dorčák E.,
Concatenation of regular languages and state complexity,
ŠVK thesis. P. J. Šafárik University, Košice
(2015)
3. Constructions for alternating finite automata∗
4. Hopcroft J.E., and
Ullman J.D.,
Introduction to Automata Theory,
Languages and Computation. Addison-Wesley
(1979)
5. STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Operations on Boolean and Alternating Finite Automata;Electronic Proceedings in Theoretical Computer Science;2023-09-03
2. Alternation in two-way finite automata;Theoretical Computer Science;2021-05
3. Regular Expressions with Lookahead;JUCS - Journal of Universal Computer Science;2021-04-28