Skip to main content
SpringerLink
Log in

Minimization of sequential transducers

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

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

Included in the following conference series:

Abstract

We present an algorithm for minimizing sequential transducers. This algorithm is shown to be efficient, since in the case of acyclic transducers it operates in O(¦E¦+¦V¦+(E¦−¦V¦+¦F¦).(¦P max ¦+1) steps, where E is the set of edges of the given transducer, V the set of its vertices, F the set of final states, and P max the longest of the greatest common prefixes of the output paths leaving each state of the transducer. It can be applied to a larger class of transducers which includes subsequential transducers.

I thank Maxime Crochemore and Dominique Perrin for interesting and helpful comments.

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. Aho, Alfred; John Hopcroft; Jeffrey Ullman. The design and analysis of computer algorithms. Reading, Mass.: Addison Wesley, (1974).

    Google Scholar 

  2. Berstel, Jean. Transductions and Context-Free Languages. Stuttgart: B.G.Teubner, (1979).

    Google Scholar 

  3. Choffrut, Christian. Contributions à l'étude de quelques familles remarquables de fonctions rationnelles. Université Paris 7, thèse de doctorat d'Etat, Paris: LITP, (1978).

    Google Scholar 

  4. Cormen, Thomas H.; Charles E. Leiserson; Ronald L. Rivest. Introduction to Algorithms. 2nd edition, Cambridge, Mass.: The MIT Press, New York: MacGraw-Hill Book Company, (1990).

    Google Scholar 

  5. Eilenberg, S.. Automata, Languages, and Machines. Volume A, New York: Academic Press, (1974).

    Google Scholar 

  6. Revuz, Dominique. Dictionnaires et lexiques, méthodes et algorithmes. Université Paris 7, thèse de doctorat, Paris: LITP, (1991).

    Google Scholar 

  7. Sedgewick, Bob. Algorithms. 2ndedition, Mass.: Addison Wesley, (1988).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut Gaspard Monge, Université Marne la Vallée, France

    Mehryar Mohri

Authors
  1. Mehryar Mohri
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Maxime Crochemore Dan Gusfield

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mohri, M. (1994). Minimization of sequential transducers. In: Crochemore, M., Gusfield, D. (eds) Combinatorial Pattern Matching. CPM 1994. Lecture Notes in Computer Science, vol 807. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58094-8_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-58094-8_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48450-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation