Abstract
We consider two natural problems about nondeterministic finite automata (NFA). First, given an NFA M of n states, and a length ℓ, does M accept a word of length ℓ? We show that the classic problem of triangle-free graph recognition reduces to this problem, and give an O(nω(logn)1+ϵlogℓ)-time algorithm to solve it, where ω is the optimal exponent for matrix multiplication. Second, provided L(M) is finite, we consider the problem of listing the lengths of all words accepted by M. Although this problem seems like it might be significantly harder, we show that in the unary case this problem can be solved in O(nω(logn)2+ϵ) time. Finally, we give a connection between NFA acceptance and the strong exponential-time hypothesis.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have