In many articles is declared that many string operations such as replace or trim can be represented as finite state transducer. A lot of materials can be found in Mehryar Mohri or Yasuhiko Minamide papers, but often papers contain only examples for concrete operation with fixed arguments. But what about algorithm for general case. Is it possible to create general algorithm to create fst for str_replace(fst1, fst2, fst3)? If it is possible then how it can be built.

Thanks.

Similar questions and discussions