Skip to main content
SpringerLink
Log in

Reducing Acyclic Cover Transducers

  • Conference paper
Book cover Implementation and Application of Automata (CIAA 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4783))

Included in the following conference series:

  • 588 Accesses

Abstract

Finite languages and finite subsequential functions can be represented by possibly cyclic finite machines, respectively called cover automata and cover transducers. In general, reduced cover machines have much fewer states than the corresponding minimal machines, yielding a compact representation for lexicons or dictionaries. We present here a new algorithm for reducing the number of states of an acyclic transducer.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

References

  1. Păun, A., Sântean, N., Yu, S.: An O(n 2) algorithm for constructing minimal cover automata for finite languages. In: Yu, S., Păun, A. (eds.) CIAA 2000. LNCS, vol. 2088, pp. 243–251. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  2. Câmpeanu, C., Păun, A., Yu, S.: An efficient algorithm for constructing minimal cover automata for finite languages. Int. J. Found. Comput. Sci. 13, 83–97 (2002)

    Article  MATH  Google Scholar 

  3. Kaneps, J., Freivalds, R.: Running time to recognize nonregular languages by 2-way probabilistic automata. In: Leach Albert, J., Monien, B., Rodríguez-Artalejo, M. (eds.) Automata, Languages and Programming. LNCS, vol. 510, pp. 174–185. Springer, Heidelberg (1991)

    Google Scholar 

  4. Dwork, C., Stockmeyer, L.: A time complexity gap for two-way probabilistic finite-state automata. SIAMJC 19, 1011–1023 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  5. Champarnaud, J.M., Guingne, F., Hansel, G.: Similarity relations and cover automata. RAIRO Theoret. Informatics Appl. 39, 115–123 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  6. Câmpeanu, C., Sântean, N., Yu, S.: Minimal cover-automata for finite languages. Theor. Comput. Sci. 267, 3–16 (2001)

    Article  MATH  Google Scholar 

  7. Körner, H.: A time and space efficient algorithm for minimizing cover automata for finite languages. Int. J. Found. Comput. Sci. 14, 1071–1086 (2003)

    Article  MATH  Google Scholar 

  8. Champarnaud, J.M., Guingne, F., Hansel, G.: Cover transducers for functions with finite domain. Int. J. Found. Comput. Sci. 16, 851–865 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  9. Schützenberger, M.P.: Sur une variante des fonctions séquentielles. Theor. Comput. Sci. 4, 47–57 (1977)

    Article  MATH  Google Scholar 

  10. Choffrut, C.: Contribution à l’étude de quelques familles remarquables de fonctions rationnelles. Thèse d’État, Université Paris 7, Mathématiques (1978)

    Google Scholar 

  11. Berstel, J.: Transductions and Context-Free Languages. vol. 38 of Leitfäden der angewandten Mathematik und Mechanik LAMM. Teubner (1979)

    Google Scholar 

  12. Choffrut, C.: Minimizing subsequential transducers: a survey. Theor. Comput. Sci. 292, 131–143 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  13. Béal, M.P., Carton, O.: Computing the prefix of an automaton. RAIRO Theoret. Informatics Appl. 34, 503–514 (2000)

    Article  MATH  Google Scholar 

  14. Mohri, M.: Minimization algorithms for sequential transducers. Theor. Comput. Sci. 234, 177–201 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  15. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: Data Structures and Algorithms. Addison-Wesley, Reading (1983)

    MATH  Google Scholar 

  16. Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM J. Comput. 16, 973–989 (1987)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire LITIS, Université de Rouen, France

    Jean-Marc Champarnaud

  2. Laboratoire I3S, Université de Nice – Sophia Antipolis and CNRS, France

    Franck Guingne & Jacques Farré

Authors
  1. Jean-Marc Champarnaud
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Franck Guingne
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jacques Farré
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jan Holub Jan Žďárek

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Champarnaud, JM., Guingne, F., Farré, J. (2007). Reducing Acyclic Cover Transducers. In: Holub, J., Žďárek, J. (eds) Implementation and Application of Automata. CIAA 2007. Lecture Notes in Computer Science, vol 4783. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76336-9_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-76336-9_6

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation