Skip to main content

Extraction of ε-Cycles from Finite-State Transducers

  • Conference paper
  • First Online:
Implementation and Application of Automata (CIAA 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2494))

Included in the following conference series:

  • 257 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. A.V. Aho, R. Sethi, and J.D. Ullman. 1986. Compilers-Principles, Techniques and Tools. Addison-Wesley, Reading, MA, USA.

    Google Scholar 

  2. G. Birkhoff and T. C. Bartee. 1970. Modern Applied Algebra. McGraw-Hill, New York, USA.

    MATH  Google Scholar 

  3. 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.

    Google Scholar 

  4. 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.

    Google Scholar 

  5. 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.

    Google Scholar 

  6. 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.

    Google Scholar 

  7. J. Sakarovitch. 1998. A construction on finite automata that has remained hidden. Theoretical Computer Science, 204:205–231.

    Article  MATH  MathSciNet  Google Scholar 

  8. M. P. Schützenberger. 1976. Sur les relations rationnelles entre monoïdes libres. Theoretical Computer Science, 3:243–259.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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

Publish with us

Policies and ethics