Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
A construction on finite automata that has remained hidden
Theoretical Computer Science - Special issue: papers dedicated to the memory of Marcel-Paul Schützenberger
Factorization of Ambiguous Finite-State Transducers
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Generic epsilon -Removal Algorithm for Weighted Automata
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Treatment of ε-moves in subset construction
FSMNLP '09 Proceedings of the International Workshop on Finite State Methods in Natural Language Processing
| Hi-index | 0.00 |
Much attention has been brought to determinization and 驴-removal in previous work. This article describes an algorithm for extracting all 驴-cycles, which are a special type of non-determinism, from an arbitrary finite-state transducer (FST). The algorithm factorizes (decomposes) the FST, T, into two FSTs, T1 and T2, such that T1 contains no 驴-cycles and T2 contains all 驴-cycles of T. Since 驴-cycles are an obstacle for some algorithms such as the factorization of ambiguous FSTs, the proposed approach allows us to by-pass this problem. 驴-Cycles can be extracted before and re-inserted (by composition) after such algorithms.