Skip to main content
SpringerLink
Log in

FSA utilities: A toolbox to manipulate finite-state automata

  • Contributed Papers
  • Conference paper
  • First Online:
Automata Implementation (WIA 1996)

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

Included in the following conference series:

Abstract

This paper describes the FSA Utilities toolbox: a collection of utilities to manipulate finite-state automata and finite-state transducers. Manipulations include determinization (both for finite-state acceptors and finite-state transducers), minimization, composition, complementation, intersection, Kleene closure, etc. Furthermore, various visualization tools are available to browse finite-state automata. The toolbox is implemented in SICStus Prolog.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Berstel, Jean 1979. Transductions and Context-Free Languages. Teubner Studienbücher, Stuttgart.

    Google Scholar 

  • Brzozowski, J.A. 1962. Canonical regular expressions and minimal state graphs for definite events. In Mathematical theory of Automata. Polytechnic Press, Polytechnic Institute of Brooklyn, N.Y., pages 529–561. Volume 12 of MRI Symposia Series.

    Google Scholar 

  • Choffrut, Ch. 1977 Une caractérisation des fonctions séquentielles et des fonctions sous-séquentielles en tant que relations rationelles. Theoretical Computer Science 5, 325–338.

    Google Scholar 

  • Fröhlich, M. and M. Werner. 1994. The graph visualization system davinci — a user interface for applications. Technical Report 5/94, Department of Computer Science; University of Bremen. Available by anonymous ftp: ftp://ftp.UniBremen.DE/pub/graphics/daVinci/papers/techrep0594.ps.gz; cf. also http://www.informatik.uni-bremen.de/-inform/forschung/daVinci/.

    Google Scholar 

  • Hopcroft, John E. 1971. An n log n algorithm for minimizing the states in a finite automaton. In: Z. Kohavi, editors, The Theory of Machines and Computations. Academic Press, pages 189–196.

    Google Scholar 

  • Hopcroft, John E. and Jeffrey D. Ullman. 1979. Introduction to Automata Theory, Languages and Computation. Addison Wesley.

    Google Scholar 

  • Kaplan, Ronald M. and Martin Kay. 1994. Regular models of phonological rule systems. Computational Linguistics, 20(3):331–378.

    Google Scholar 

  • Lang, Bernard. 1989. A generative view of ill-formed input processing. In ATR Symposium on Basic Research for Telephone Interpretation (ASTI), Kyoto Japan.

    Google Scholar 

  • van Noord, Gertjan. 1995. The intersection of finite state automata and definite clause grammars. In 33th Annual Meeting of the Association for Computational Linguistics, MIT Boston. Available from http://www.let.rug.nl/108-02vannoord/papers/.

    Google Scholar 

  • Oerder, Martin and Hermann Ney. 1993. Word graphs: An efficient interface between continuous-speech recognition and language understanding. In ICASSP Volume 2, pages 119–122.

    Google Scholar 

  • Ousterhout, John K. 1994. Tcl and the Tk Toolkit. Addison Wesley.

    Google Scholar 

  • Pereira, Fernando C. N. and Michael D. Riley. 1996. Speech recognition by composition of weighted finite automata. Available as cmp-lg/9603001 from http://xxx.lanl.gov/cmp-lg.

    Google Scholar 

  • Roche, Emmanuel and Yves Schabes. 1995. Deterministic part-of-speech tagging with finite-state transducers. Computational Linguistics, 21(2).

    Google Scholar 

  • Sander, G. 1995. Graph layout through the VCG tool. In R. Tamassia and I.G. Tollis, editors, Graph Drawing, DIMACS International Workshop GD '94, Proceedings; Lecture Notes in Computer Science 894. Springer Verlag, pages 194–205. cf. also http://www.cs.uni-sb.de/RW/users/sander/html/gsvcgl.html.

    Google Scholar 

  • Voutilainen, Atro and Pasi Tapanainen. 1993. Ambiguity resolution in a reductionist parser. In Sixth Conference of the European Chapter of the Association for Computational Linguistics, Utrecht.

    Google Scholar 

  • Watson, Bruce W. 1995. Taxonomies and Toolkits of Regular Language Algorithms. Proefschrift Eindhoven University of Technology.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Vakgroep Alfa-informatica & BCN, Rijksuniversiteit Groningen, Netherlands

    Gertjan van Noord

Authors
  1. Gertjan van Noord
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Darrell Raymond Derick Wood Sheng Yu

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

van Noord, G. (1997). FSA utilities: A toolbox to manipulate finite-state automata. In: Raymond, D., Wood, D., Yu, S. (eds) Automata Implementation. WIA 1996. Lecture Notes in Computer Science, vol 1260. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63174-7_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-63174-7_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63174-3

  • Online ISBN: 978-3-540-69205-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation