Skip to main content
SpringerLink
Log in

Smaller representations for finite-state transducers and finite-state automata

  • Conference paper
  • First Online:
Combinatorial Pattern Matching (CPM 1995)

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

Included in the following conference series:

Abstract

Finite-state transducers and finite-state automata are efficient and natural representations for a large variety of problems. We describe a new algorithm for turning a finite-state transducer into the composition of two deterministic finite-state transducers such that the combined size of the derived transducers can be exponentially smaller than other known deterministic constructions. As a consequence, this can also be used to build deterministic representations of finite-state automata smaller than the minimal finite-state automata computed by the classic determinization and minimization algorithms. We also report experimental results on large scale dictionaries and rule-based systems.

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

  1. Alfred Aho, John Hopcroft, and Jeffrey Ulllman. The design and analysis of computer algorithms. Addison Wesley, 1974.

    Google Scholar 

  2. Jean Berstel. Transductions and Context-Free Languages. Teubner, Stuttgart, 1979.

    Google Scholar 

  3. D. Brelaz. New methods to color vertices of a graph. Comm. ACM, 22:251–256, 1970.

    Article  Google Scholar 

  4. Samuel Eilenberg. Automata, languages, and machines, Volume A. Academic Press, New York, 1974.

    Google Scholar 

  5. C. C. Elgot and G. Mezei. On relations dfined by generalized finite automata. IBM J. of Res. and Dev., 9:47–65, 1965.

    Google Scholar 

  6. Maurice Gross. Méthodes en syntaxe,régime des constructions complétives. Hermann, 1975.

    Google Scholar 

  7. David S. Johnson, Cecilia R. Aragon, Lyle A. McGeoch, and Catherine Schevon. Optimization by simulated annealing: an experimental evaluation; part ii, graph coloring and number partitionning. Operations Research, 39(3):378–406, 1991.

    Google Scholar 

  8. R. M. Karp. Reducibility among combinatorial problems, in R. E. Miller and J. W. Thatcher (eds.)’ Complexity of Computer Computations'. Plenum Press, New York, 1972.

    Google Scholar 

  9. Eric Laporte. Méthodes algorithmiques et lexicales de phonetisation de textes. PhD thesis, Université Paris 7, 1988.

    Google Scholar 

  10. F. T. Leighton. A graph coloring algorithm for large scheduling problems. J. Res. Natl. Bur. Standards, 84:489–506, 1979.

    Google Scholar 

  11. Mehryar Mohri. Minimisation of sequential transducers. In Proceedings of the Conference on Computational Pattern Matching 1994, 1994.

    Google Scholar 

  12. Christophe Reutenauer and Marcel-Paul Schutzenberger. Minnimization of rational word functions. SIAM J. Comput., 20:669–685, 1991.

    Google Scholar 

  13. Emmanuel Roche. Analyse Syntaxique Transformationelle du FranÇais par Transducteurs et Lexique-Grammaire. PhD thesis, Université Paris 7, January 1993.

    Google Scholar 

  14. Marcel Paul Schutzenberger. A remark on finite transducers. Information and Control, 4:185–187, 1961.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mitsubishi Electric Research Laboratories 201, Broadway, 02139, Cambridge, MA

    Emmanuel Roche

Authors
  1. Emmanuel Roche
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Zvi Galil Esko Ukkonen

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Roche, E. (1995). Smaller representations for finite-state transducers and finite-state automata. In: Galil, Z., Ukkonen, E. (eds) Combinatorial Pattern Matching. CPM 1995. Lecture Notes in Computer Science, vol 937. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60044-2_54

Download citation

  • DOI: https://doi.org/10.1007/3-540-60044-2_54

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60044-2

  • Online ISBN: 978-3-540-49412-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation