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
Treatment of ε-moves in subset construction
FSMNLP '09 Proceedings of the International Workshop on Finite State Methods in Natural Language Processing
Acyclic networks maximizing the printing complexity
Theoretical Computer Science - Implementation and application of automata
| 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 particular type of nondeterminism, from an arbitrary finite-state transducer (FST). the algorithm decomposes the FST, T, into two FSTs, T1 and T2, such that T1 contains no ε-cycles and T2 contains all ε-cycles of T. The article also proposes an alternative approach where each ε-cycle of T is replaced by a single transitions with a complex label that describes the output of the cycle, Since ε-cycles are an obstacle for some algorithms such as the decomposition of ambiguous FSTs, the proposed approaches allow us to by-pass this problem, ε-Cycles can be extracted or recoded before and re-inserted (by composition) after such algorithms.