I have an unweighted finite state acceptor (FSA), and a sequence of symbols. I want to check if this symbol sequence is a prefix of a symbol sequence accepted by the FSA.
There could be <eps> transitions in the FSA. And I don't think this is a simple matter of calling fstcompose (like here), as we are dealing with prefix.
One hack I can think of is to modify the FSA such that each state is a final state. Then the prefix of an accepted string can now be accepted by the modified FSA. But any other idea?
