Abstract
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, T 1 and T 2, such that T 1 contains no ε-cycles and T 2 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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
A.V. Aho, R. Sethi, and J.D. Ullman. 1986. Compilers-Principles, Techniques and Tools. Addison-Wesley, Reading, MA, USA.
G. Birkhoff and T. C. Bartee. 1970. Modern Applied Algebra. McGraw-Hill, New York, USA.
A. Kempe. 2000. Reduction of intermediate alphabets in finite-state transducer cascades. In Proceedings of the 7th Conference on Automatic Natural Language Processing (TALN), pages 207–215, Lausanne, Switzerland. ATALA.
A. Kempe. 2001. Factorization of ambiguous finite-state transducers. In S. Yu, A. Paun, editors, Proceedings of the 5th International Conference on Implementation and Application of Automata (CIAA 2000), The University of Western Ontario, London, Ontario, Canada, July 24–25, 2000. Volume 2088 of Lecture Notes in Computer Science, pages 170–181, Springer-Verlag.
M. Mohri. 2001. Generic a-removal algorithm for weighted automata. In S. Yu, A. Paun, editors, Proceedings of the 5th International Conference on Implementation and Application of Automata (CIAA 2000), The University of Western Ontario, London, Ontario, Canada, July 24–25, 2000. Volume 2088 of Lecture Notes in Computer Science, pages 230–242, Springer-Verlag.
G. van Noord. 1998. Treatment of ε-moves in subset construction. In Proceedings of the International Workshop on Finite-State Methods in Natural Language Processing (FSMNLP), pages 1–12, Ankara, Turkey, June 29–July 1. Bilkent University.
J. Sakarovitch. 1998. A construction on finite automata that has remained hidden. Theoretical Computer Science, 204:205–231.
M. P. Schützenberger. 1976. Sur les relations rationnelles entre monoïdes libres. Theoretical Computer Science, 3:243–259.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kempe, A. (2002). Extraction of ε-Cycles from Finite-State Transducers. In: Watson, B.W., Wood, D. (eds) Implementation and Application of Automata. CIAA 2001. Lecture Notes in Computer Science, vol 2494. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36390-4_16
Download citation
DOI: https://doi.org/10.1007/3-540-36390-4_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00400-4
Online ISBN: 978-3-540-36390-3
eBook Packages: Springer Book Archive